java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:46:30,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:46:30,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:46:30,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:46:30,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:46:30,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:46:30,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:46:30,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:46:30,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:46:30,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:46:30,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:46:30,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:46:30,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:46:30,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:46:30,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:46:30,590 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:46:30,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:46:30,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:46:30,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:46:30,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:46:30,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:46:30,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:46:30,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:46:30,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:46:30,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:46:30,612 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:46:30,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:46:30,614 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:46:30,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:46:30,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:46:30,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:46:30,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:46:30,620 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:46:30,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:46:30,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:46:30,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:46:30,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:46:30,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:46:30,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:46:30,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:46:30,649 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:46:30,649 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:46:30,649 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:46:30,649 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:46:30,650 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:46:30,650 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:46:30,650 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:46:30,650 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:46:30,650 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:46:30,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:46:30,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:46:30,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:46:30,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:46:30,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:46:30,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:46:30,655 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:46:30,655 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:46:30,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:46:30,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:46:30,656 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:46:30,656 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:46:30,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:46:30,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:46:30,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:46:30,657 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:46:30,657 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:46:30,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:46:30,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:46:30,658 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:46:30,658 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:46:30,658 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:46:30,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:46:30,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:46:30,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:46:30,723 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:46:30,724 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:46:30,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-07 16:46:30,780 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa440f913/e89e919f19634acba484a16879db841e/FLAGf143394ce [2018-11-07 16:46:31,201 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:46:31,201 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-07 16:46:31,209 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa440f913/e89e919f19634acba484a16879db841e/FLAGf143394ce [2018-11-07 16:46:31,224 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa440f913/e89e919f19634acba484a16879db841e [2018-11-07 16:46:31,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:46:31,236 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:46:31,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:46:31,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:46:31,241 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:46:31,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5032af73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31, skipping insertion in model container [2018-11-07 16:46:31,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:46:31,281 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:46:31,522 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:46:31,537 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:46:31,553 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:46:31,569 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:46:31,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31 WrapperNode [2018-11-07 16:46:31,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:46:31,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:46:31,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:46:31,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:46:31,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:46:31,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:46:31,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:46:31,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:46:31,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... [2018-11-07 16:46:31,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:46:31,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:46:31,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:46:31,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:46:31,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:46:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:46:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:46:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 16:46:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:46:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:46:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:46:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:46:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:46:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:46:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:46:31,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:46:32,162 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:46:32,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:32 BoogieIcfgContainer [2018-11-07 16:46:32,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:46:32,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:46:32,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:46:32,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:46:32,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:46:31" (1/3) ... [2018-11-07 16:46:32,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a23e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:32, skipping insertion in model container [2018-11-07 16:46:32,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:46:31" (2/3) ... [2018-11-07 16:46:32,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a23e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:46:32, skipping insertion in model container [2018-11-07 16:46:32,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:46:32" (3/3) ... [2018-11-07 16:46:32,171 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-07 16:46:32,179 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:46:32,186 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:46:32,201 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:46:32,242 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:46:32,242 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:46:32,242 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:46:32,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:46:32,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:46:32,243 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:46:32,243 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:46:32,243 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:46:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-07 16:46:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:46:32,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:32,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:32,271 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:32,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash 849314513, now seen corresponding path program 1 times [2018-11-07 16:46:32,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:32,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,334 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:32,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:32,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:46:32,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:32,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:46:32,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:46:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:46:32,459 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-07 16:46:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:32,479 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-07 16:46:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:46:32,481 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 16:46:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:32,488 INFO L225 Difference]: With dead ends: 49 [2018-11-07 16:46:32,488 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:46:32,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:46:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:46:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 16:46:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:46:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-07 16:46:32,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2018-11-07 16:46:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:32,534 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-07 16:46:32,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:46:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-07 16:46:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:46:32,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:32,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:32,539 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:32,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:32,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1258796197, now seen corresponding path program 1 times [2018-11-07 16:46:32,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:32,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:32,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:46:32,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:46:32,875 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:46:32,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:46:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:46:32,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:46:32,878 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-11-07 16:46:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:33,046 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-07 16:46:33,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:46:33,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 16:46:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:33,048 INFO L225 Difference]: With dead ends: 45 [2018-11-07 16:46:33,048 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:46:33,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:46:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:46:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-07 16:46:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 16:46:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-07 16:46:33,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2018-11-07 16:46:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:33,056 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-07 16:46:33,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:46:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-07 16:46:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:46:33,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:33,058 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:33,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:33,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 11668962, now seen corresponding path program 1 times [2018-11-07 16:46:33,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:33,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:33,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:33,061 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:33,359 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2018-11-07 16:46:33,543 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2018-11-07 16:46:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:33,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:33,676 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 16:46:33,678 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [15], [18], [20], [21], [23], [27], [31], [36], [37], [47], [50], [52], [58], [59], [60], [62] [2018-11-07 16:46:33,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:46:33,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:46:33,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:46:33,984 INFO L272 AbstractInterpreter]: Visited 22 different actions 82 times. Merged at 9 different actions 43 times. Widened at 2 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-07 16:46:34,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:34,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:46:34,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:34,017 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:34,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:34,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:34,241 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-11-07 16:46:34,245 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-11-07 16:46:34,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-07 16:46:34,403 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-11-07 16:46:34,415 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-11-07 16:46:34,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-07 16:46:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:34,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:34,677 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-11-07 16:46:34,876 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-07 16:46:34,895 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-11-07 16:46:34,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:34,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5 [2018-11-07 16:46:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:34,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:34,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2018-11-07 16:46:34,996 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:34,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:46:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:46:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:46:34,998 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2018-11-07 16:46:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:35,396 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-07 16:46:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:46:35,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-07 16:46:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:35,399 INFO L225 Difference]: With dead ends: 42 [2018-11-07 16:46:35,399 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:46:35,400 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:46:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:46:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-07 16:46:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:46:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-07 16:46:35,409 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 23 [2018-11-07 16:46:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:35,409 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-07 16:46:35,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:46:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-07 16:46:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:46:35,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:35,411 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:35,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:35,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1730228756, now seen corresponding path program 1 times [2018-11-07 16:46:35,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:35,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:35,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:35,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:35,518 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-07 16:46:35,519 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [15], [18], [20], [21], [23], [27], [31], [36], [37], [39], [41], [47], [50], [52], [55], [57], [58], [59], [60], [62], [63] [2018-11-07 16:46:35,521 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:46:35,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:46:35,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:46:35,718 INFO L272 AbstractInterpreter]: Visited 27 different actions 109 times. Merged at 12 different actions 53 times. Widened at 3 different actions 3 times. Found 6 fixpoints after 4 different actions. Largest state had 21 variables. [2018-11-07 16:46:35,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:35,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:46:35,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:35,743 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:35,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:35,754 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:35,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:35,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:36,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:36,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-07 16:46:36,007 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:36,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:46:36,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:46:36,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:46:36,008 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 10 states. [2018-11-07 16:46:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:36,187 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-11-07 16:46:36,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:46:36,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-07 16:46:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:36,192 INFO L225 Difference]: With dead ends: 63 [2018-11-07 16:46:36,193 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:46:36,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:46:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:46:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-07 16:46:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 16:46:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-07 16:46:36,204 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-11-07 16:46:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:36,204 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-07 16:46:36,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:46:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-07 16:46:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 16:46:36,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:36,206 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:36,206 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:36,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash -464225189, now seen corresponding path program 2 times [2018-11-07 16:46:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:36,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:36,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:36,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:36,456 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:36,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:36,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:36,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:36,471 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:36,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:46:36,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:36,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:36,574 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-11-07 16:46:36,576 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-11-07 16:46:36,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:36,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:36,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:36,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 16:46:37,044 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-11-07 16:46:37,047 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:46:37,048 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-11-07 16:46:37,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:37,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:37,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:37,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 16:46:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:37,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:37,636 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-11-07 16:46:37,652 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-11-07 16:46:37,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:37,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:37,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:37,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 16:46:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:46:37,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:37,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2018-11-07 16:46:37,725 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:37,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:46:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:46:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:46:37,727 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 23 states. [2018-11-07 16:46:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:42,843 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-07 16:46:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 16:46:42,844 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-11-07 16:46:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:42,846 INFO L225 Difference]: With dead ends: 75 [2018-11-07 16:46:42,846 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 16:46:42,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:46:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 16:46:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 16:46:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:46:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-07 16:46:42,857 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 37 [2018-11-07 16:46:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:42,858 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-07 16:46:42,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:46:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-07 16:46:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 16:46:42,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:42,861 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:42,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:42,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1917919404, now seen corresponding path program 3 times [2018-11-07 16:46:42,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:42,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:42,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:42,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:46:43,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:43,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:43,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:43,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:43,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:43,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:43,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:46:43,319 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:46:43,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:46:43,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:43,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:43,380 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-11-07 16:46:43,399 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-11-07 16:46:43,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:43,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:43,437 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-11-07 16:46:43,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-07 16:46:50,750 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-11-07 16:46:50,767 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:46:50,767 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-11-07 16:46:50,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:50,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:50,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:50,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-11-07 16:46:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:46:50,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:52,943 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 20 treesize of output 18 [2018-11-07 16:46:52,963 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 11 treesize of output 3 [2018-11-07 16:46:52,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:52,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:52,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-11-07 16:46:52,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-07 16:46:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:46:53,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:53,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 20 [2018-11-07 16:46:53,006 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:53,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:46:53,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:46:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=325, Unknown=3, NotChecked=0, Total=380 [2018-11-07 16:46:53,007 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 19 states. [2018-11-07 16:46:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:57,746 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-07 16:46:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:46:57,747 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-07 16:46:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:57,748 INFO L225 Difference]: With dead ends: 70 [2018-11-07 16:46:57,748 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 16:46:57,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=108, Invalid=645, Unknown=3, NotChecked=0, Total=756 [2018-11-07 16:46:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 16:46:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-11-07 16:46:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 16:46:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-07 16:46:57,775 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 51 [2018-11-07 16:46:57,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:57,775 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-07 16:46:57,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:46:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-07 16:46:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 16:46:57,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:57,777 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:57,778 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:57,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash -320578298, now seen corresponding path program 4 times [2018-11-07 16:46:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:57,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:46:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:57,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:46:58,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:58,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:58,043 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:58,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:58,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:58,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:58,053 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:46:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:58,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:46:58,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:46:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:46:58,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:46:58,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-11-07 16:46:58,439 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:46:58,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:46:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:46:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:46:58,441 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 16 states. [2018-11-07 16:46:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:46:58,962 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-07 16:46:58,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:46:58,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 16:46:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:46:58,964 INFO L225 Difference]: With dead ends: 103 [2018-11-07 16:46:58,964 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:46:58,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:46:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:46:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-07 16:46:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 16:46:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-07 16:46:58,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2018-11-07 16:46:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:46:58,975 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-07 16:46:58,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:46:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-07 16:46:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 16:46:58,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:46:58,976 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:46:58,977 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:46:58,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:46:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash -53672243, now seen corresponding path program 5 times [2018-11-07 16:46:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:46:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:58,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:46:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:46:58,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:46:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:46:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 5 proven. 69 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:46:59,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:59,678 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:46:59,679 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:46:59,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:46:59,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:46:59,679 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:46:59,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:46:59,688 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:46:59,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 16:46:59,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:46:59,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:46:59,820 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-11-07 16:46:59,821 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-11-07 16:46:59,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:46:59,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:59,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:46:59,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 16:47:00,606 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-11-07 16:47:00,608 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:47:00,609 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-11-07 16:47:00,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:00,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:00,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:00,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 16:47:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:47:00,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:00,997 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-11-07 16:47:01,011 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-11-07 16:47:01,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:01,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:01,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:01,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 16:47:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:47:01,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:01,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 38 [2018-11-07 16:47:01,113 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:01,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:47:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:47:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:47:01,115 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 31 states. [2018-11-07 16:47:03,000 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-07 16:47:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:11,818 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-07 16:47:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:47:11,819 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-11-07 16:47:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:11,821 INFO L225 Difference]: With dead ends: 119 [2018-11-07 16:47:11,821 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 16:47:11,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 99 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=504, Invalid=3918, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 16:47:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 16:47:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-07 16:47:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 16:47:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-07 16:47:11,833 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 65 [2018-11-07 16:47:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:11,834 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-07 16:47:11,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:47:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-07 16:47:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 16:47:11,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:11,835 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:11,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:11,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1837972794, now seen corresponding path program 6 times [2018-11-07 16:47:11,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:11,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:11,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 112 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:47:12,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:12,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:12,213 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:12,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:12,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:12,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:47:12,225 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:47:12,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:47:12,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:12,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:12,289 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-11-07 16:47:12,291 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-11-07 16:47:12,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:12,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:12,302 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-11-07 16:47:12,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-07 16:47:44,703 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-11-07 16:47:44,705 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:47:44,705 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-11-07 16:47:44,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:44,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:44,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:44,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-07 16:47:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:47:44,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:46,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 18 treesize of output 16 [2018-11-07 16:47:46,911 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-11-07 16:47:46,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:46,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:46,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:46,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-11-07 16:47:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:47:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:46,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 26 [2018-11-07 16:47:46,960 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:46,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:47:46,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:47:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=575, Unknown=5, NotChecked=0, Total=650 [2018-11-07 16:47:46,962 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 25 states. [2018-11-07 16:47:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:55,790 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-07 16:47:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 16:47:55,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-07 16:47:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:55,792 INFO L225 Difference]: With dead ends: 98 [2018-11-07 16:47:55,792 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 16:47:55,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 135 SyntacticMatches, 20 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=142, Invalid=1113, Unknown=5, NotChecked=0, Total=1260 [2018-11-07 16:47:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 16:47:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-11-07 16:47:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 16:47:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 16:47:55,804 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 79 [2018-11-07 16:47:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:55,805 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 16:47:55,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:47:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 16:47:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 16:47:55,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:55,806 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:55,807 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:55,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 843061752, now seen corresponding path program 7 times [2018-11-07 16:47:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:55,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:47:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:55,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:47:56,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:56,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:56,001 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:56,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:56,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:56,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:56,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:56,013 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:47:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:56,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:47:56,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:47:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:47:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:47:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-11-07 16:47:56,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:47:56,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:47:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:47:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-11-07 16:47:56,470 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 22 states. [2018-11-07 16:47:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:47:56,772 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-11-07 16:47:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:47:56,772 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-11-07 16:47:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:47:56,773 INFO L225 Difference]: With dead ends: 143 [2018-11-07 16:47:56,774 INFO L226 Difference]: Without dead ends: 98 [2018-11-07 16:47:56,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:47:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-07 16:47:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-07 16:47:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 16:47:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-07 16:47:56,786 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 89 [2018-11-07 16:47:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:47:56,786 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-07 16:47:56,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:47:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-07 16:47:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 16:47:56,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:47:56,788 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:47:56,788 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:47:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:47:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1323572417, now seen corresponding path program 8 times [2018-11-07 16:47:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:47:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:47:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:47:56,790 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:47:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:47:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 9 proven. 165 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:47:57,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:57,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:47:57,253 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:47:57,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:47:57,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:47:57,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:47:57,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:47:57,264 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:47:57,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 16:47:57,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:47:57,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:47:57,438 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-11-07 16:47:57,439 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-11-07 16:47:57,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:57,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:57,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:57,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 16:47:58,638 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-11-07 16:47:58,641 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:47:58,641 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-11-07 16:47:58,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:47:58,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:58,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:47:58,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 16:47:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 70 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:47:58,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:48:00,496 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-11-07 16:48:00,510 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-11-07 16:48:00,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:48:00,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:48:00,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:48:00,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 16:48:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 70 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:48:00,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:48:00,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 48 [2018-11-07 16:48:00,659 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:48:00,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 16:48:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 16:48:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2008, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 16:48:00,661 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 39 states. [2018-11-07 16:48:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:48:11,106 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-11-07 16:48:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 16:48:11,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 93 [2018-11-07 16:48:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:48:11,108 INFO L225 Difference]: With dead ends: 167 [2018-11-07 16:48:11,108 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 16:48:11,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 143 SyntacticMatches, 20 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=795, Invalid=7395, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 16:48:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 16:48:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-11-07 16:48:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-07 16:48:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-07 16:48:11,123 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 93 [2018-11-07 16:48:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:48:11,123 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-07 16:48:11,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 16:48:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-07 16:48:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 16:48:11,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:48:11,125 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:48:11,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:48:11,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:48:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -570673096, now seen corresponding path program 9 times [2018-11-07 16:48:11,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:48:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:11,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:48:11,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:48:11,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:48:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:48:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 11 proven. 228 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 16:48:12,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:12,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:48:12,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:48:12,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:48:12,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:48:12,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:48:12,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:48:12,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:48:12,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:48:12,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:48:12,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:48:12,202 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-11-07 16:48:12,204 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-11-07 16:48:12,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:48:12,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:48:12,211 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-11-07 16:48:12,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-07 16:49:06,095 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-11-07 16:49:06,100 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:49:06,100 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-11-07 16:49:06,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:06,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:06,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:06,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-07 16:49:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:49:06,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:06,938 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-11-07 16:49:06,950 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-11-07 16:49:06,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:06,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:06,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:06,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-11-07 16:49:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 12 proven. 212 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 16:49:07,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:07,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 32 [2018-11-07 16:49:07,010 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:07,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 16:49:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 16:49:07,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=897, Unknown=7, NotChecked=0, Total=992 [2018-11-07 16:49:07,012 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 31 states. [2018-11-07 16:49:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:20,331 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-11-07 16:49:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 16:49:20,331 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2018-11-07 16:49:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:20,333 INFO L225 Difference]: With dead ends: 126 [2018-11-07 16:49:20,333 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 16:49:20,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 183 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 55.7s TimeCoverageRelationStatistics Valid=176, Invalid=1709, Unknown=7, NotChecked=0, Total=1892 [2018-11-07 16:49:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 16:49:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-11-07 16:49:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 16:49:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-11-07 16:49:20,345 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 107 [2018-11-07 16:49:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:20,345 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-11-07 16:49:20,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 16:49:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-11-07 16:49:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 16:49:20,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:20,347 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:20,347 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:20,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 974317802, now seen corresponding path program 10 times [2018-11-07 16:49:20,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:20,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:20,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 130 proven. 136 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:49:20,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:20,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:20,584 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:20,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:20,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:20,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:20,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:20,597 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:20,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 168 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:49:20,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 168 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:49:20,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:20,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2018-11-07 16:49:20,959 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:20,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 16:49:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 16:49:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-11-07 16:49:20,961 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 28 states. [2018-11-07 16:49:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:21,575 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-11-07 16:49:21,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:49:21,576 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-11-07 16:49:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:21,578 INFO L225 Difference]: With dead ends: 183 [2018-11-07 16:49:21,578 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 16:49:21,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 210 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 16:49:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 16:49:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-07 16:49:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-07 16:49:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-11-07 16:49:21,589 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 117 [2018-11-07 16:49:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:21,590 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-11-07 16:49:21,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 16:49:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-11-07 16:49:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 16:49:21,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:21,592 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:21,592 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:21,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1644138929, now seen corresponding path program 11 times [2018-11-07 16:49:21,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:21,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:21,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 13 proven. 301 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:49:22,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:22,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:22,940 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:22,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:22,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:22,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:22,948 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:23,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:49:23,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:23,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:23,196 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-11-07 16:49:23,201 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-11-07 16:49:23,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:23,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:23,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:23,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 16:49:24,792 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-11-07 16:49:24,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:49:24,795 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-11-07 16:49:24,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:24,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:24,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:24,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 16:49:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 140 proven. 156 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:49:24,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:25,554 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-11-07 16:49:25,567 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-11-07 16:49:25,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:25,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:25,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:25,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 16:49:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 140 proven. 156 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 16:49:25,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:25,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 25] total 58 [2018-11-07 16:49:25,791 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:25,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 16:49:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 16:49:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2955, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 16:49:25,793 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 47 states. [2018-11-07 16:49:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:53,938 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-11-07 16:49:53,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 16:49:53,939 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 121 [2018-11-07 16:49:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:53,941 INFO L225 Difference]: With dead ends: 215 [2018-11-07 16:49:53,941 INFO L226 Difference]: Without dead ends: 130 [2018-11-07 16:49:53,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 193 SyntacticMatches, 26 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2246 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=891, Invalid=8421, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 16:49:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-07 16:49:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-11-07 16:49:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-07 16:49:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-11-07 16:49:53,956 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 121 [2018-11-07 16:49:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:53,956 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-11-07 16:49:53,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 16:49:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-11-07 16:49:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 16:49:53,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:53,958 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:53,958 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -28541192, now seen corresponding path program 12 times [2018-11-07 16:49:53,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:53,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:53,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 13 proven. 335 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 16:49:54,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:54,525 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:54,525 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:54,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:54,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:54,526 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:54,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:54,535 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:54,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:54,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:54,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:54,596 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-11-07 16:49:54,597 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-11-07 16:49:54,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:54,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:54,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:54,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-07 16:49:54,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-07 16:49:54,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:49:54,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-11-07 16:49:54,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:49:54,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:49:54,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 16:49:54,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-11-07 16:50:09,532 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-07 16:50:09,776 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2018-11-07 16:50:23,788 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-07 16:50:24,013 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2018-11-07 16:50:25,459 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 32 treesize of output 26 [2018-11-07 16:50:25,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 16:50:25,462 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 16:50:25,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-07 16:50:25,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:50:25,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:50:25,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:50:25,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-11-07 16:50:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 8 proven. 348 refuted. 39 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 16:50:25,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:25,921 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-11-07 16:50:25,933 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-11-07 16:50:25,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:50:25,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:50:25,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:50:25,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-11-07 16:50:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 16 proven. 313 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-07 16:50:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:25,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31, 23] total 46 [2018-11-07 16:50:25,994 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:25,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 16:50:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 16:50:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1872, Unknown=7, NotChecked=0, Total=2070 [2018-11-07 16:50:25,995 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 44 states. [2018-11-07 16:50:28,804 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-07 16:50:46,922 WARN L179 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-11-07 16:51:00,750 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 54 Received shutdown request... [2018-11-07 16:51:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 16:51:08,947 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:51:08,952 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:51:08,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:51:08 BoogieIcfgContainer [2018-11-07 16:51:08,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:51:08,953 INFO L168 Benchmark]: Toolchain (without parser) took 277718.01 ms. Allocated memory was 1.6 GB in the beginning and 2.5 GB in the end (delta: 934.3 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -937.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:08,954 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:08,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.44 ms. Allocated memory is still 1.6 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-11-07 16:51:08,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.93 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:08,955 INFO L168 Benchmark]: Boogie Preprocessor took 33.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:51:08,955 INFO L168 Benchmark]: RCFGBuilder took 536.74 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 762.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:51:08,956 INFO L168 Benchmark]: TraceAbstraction took 276788.64 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 171.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -141.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:51:08,959 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.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.44 ms. Allocated memory is still 1.6 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 20.93 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 536.74 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 762.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 276788.64 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 171.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -141.0 MB). Peak memory consumption was 30.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 constructing difference of abstraction (128states) and FLOYD_HOARE automaton (currently 26 states, 44 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. TIMEOUT Result, 276.7s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 126.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 866 SDslu, 5587 SDs, 0 SdLazy, 8340 SolverSat, 455 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 97.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2450 GetRequests, 1685 SyntacticMatches, 194 SemanticMatches, 570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8819 ImplicationChecksByTransitivity, 172.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 40 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 147.9s InterpolantComputationTime, 2039 NumberOfCodeBlocks, 2031 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2999 ConstructedInterpolants, 424 QuantifiedInterpolants, 2265207 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1916 ConjunctsInSsa, 284 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 2589/6462 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown