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-LIM.epf -i ../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:30:36,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:30:36,640 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:30:36,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:30:36,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:30:36,661 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:30:36,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:30:36,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:30:36,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:30:36,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:30:36,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:30:36,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:30:36,673 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:30:36,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:30:36,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:30:36,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:30:36,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:30:36,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:30:36,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:30:36,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:30:36,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:30:36,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:30:36,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:30:36,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:30:36,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:30:36,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:30:36,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:30:36,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:30:36,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:30:36,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:30:36,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:30:36,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:30:36,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:30:36,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:30:36,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:30:36,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:30:36,722 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-LIM.epf [2018-11-12 20:30:36,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:30:36,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:30:36,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:30:36,743 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:30:36,743 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:30:36,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:30:36,744 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:30:36,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:30:36,744 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:30:36,745 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:30:36,745 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:30:36,745 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:30:36,745 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:30:36,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:30:36,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:30:36,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:30:36,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:30:36,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:30:36,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:30:36,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:30:36,747 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:30:36,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:30:36,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:30:36,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:30:36,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:30:36,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:30:36,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:30:36,749 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:30:36,749 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:30:36,749 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:30:36,750 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:30:36,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:30:36,750 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:30:36,750 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:30:36,751 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:30:36,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:30:36,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:30:36,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:30:36,812 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:30:36,813 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:30:36,813 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-12 20:30:36,874 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700111927/b46c0729a7134745acfa5ed5f6c613dc/FLAG6a45cc838 [2018-11-12 20:30:37,334 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:30:37,335 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-12 20:30:37,342 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700111927/b46c0729a7134745acfa5ed5f6c613dc/FLAG6a45cc838 [2018-11-12 20:30:37,365 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700111927/b46c0729a7134745acfa5ed5f6c613dc [2018-11-12 20:30:37,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:30:37,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:30:37,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:30:37,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:30:37,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:30:37,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425d5bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37, skipping insertion in model container [2018-11-12 20:30:37,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:30:37,420 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:30:37,641 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:30:37,645 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:30:37,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:30:37,705 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:30:37,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37 WrapperNode [2018-11-12 20:30:37,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:30:37,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:30:37,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:30:37,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:30:37,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:30:37,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:30:37,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:30:37,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:30:37,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (1/1) ... [2018-11-12 20:30:37,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:30:37,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:30:37,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:30:37,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:30:37,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (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-12 20:30:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:30:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:30:37,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:30:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:30:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:30:37,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:30:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:30:37,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:30:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:30:37,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:30:37,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:30:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-12 20:30:37,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:30:38,433 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:30:38,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:30:38 BoogieIcfgContainer [2018-11-12 20:30:38,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:30:38,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:30:38,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:30:38,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:30:38,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:30:37" (1/3) ... [2018-11-12 20:30:38,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fe0afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:30:38, skipping insertion in model container [2018-11-12 20:30:38,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:30:37" (2/3) ... [2018-11-12 20:30:38,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fe0afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:30:38, skipping insertion in model container [2018-11-12 20:30:38,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:30:38" (3/3) ... [2018-11-12 20:30:38,443 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_true-unreach-call.i [2018-11-12 20:30:38,453 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:30:38,461 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:30:38,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:30:38,511 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:30:38,511 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:30:38,511 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:30:38,512 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:30:38,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:30:38,512 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:30:38,512 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:30:38,512 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:30:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-12 20:30:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:30:38,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:38,542 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-12 20:30:38,545 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:38,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash -450684723, now seen corresponding path program 1 times [2018-11-12 20:30:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:38,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:38,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:38,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:38,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:38,718 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-12 20:30:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:30:38,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:30:38,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:38,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:30:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:30:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:30:38,744 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-12 20:30:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:38,766 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2018-11-12 20:30:38,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:30:38,768 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-12 20:30:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:38,775 INFO L225 Difference]: With dead ends: 77 [2018-11-12 20:30:38,776 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:30:38,781 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-12 20:30:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:30:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-12 20:30:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-12 20:30:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-12 20:30:38,818 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2018-11-12 20:30:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:38,820 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-12 20:30:38,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:30:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-12 20:30:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:30:38,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:38,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:38,823 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:38,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1427074857, now seen corresponding path program 1 times [2018-11-12 20:30:38,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:38,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:38,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:38,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:38,948 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-12 20:30:38,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:30:38,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:30:38,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:38,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:30:38,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:30:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:30:38,953 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 3 states. [2018-11-12 20:30:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:39,099 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2018-11-12 20:30:39,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:30:39,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-12 20:30:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:39,103 INFO L225 Difference]: With dead ends: 83 [2018-11-12 20:30:39,103 INFO L226 Difference]: Without dead ends: 56 [2018-11-12 20:30:39,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:30:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-12 20:30:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-11-12 20:30:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:30:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-12 20:30:39,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2018-11-12 20:30:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:39,113 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-12 20:30:39,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:30:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-12 20:30:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:30:39,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:39,115 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:39,115 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:39,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 367341036, now seen corresponding path program 1 times [2018-11-12 20:30:39,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:39,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:39,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:39,246 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-12 20:30:39,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:39,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:39,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-12 20:30:39,250 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [39], [43], [46], [72], [76], [78], [81], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:39,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:39,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:39,534 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:40,070 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 20:30:40,072 INFO L272 AbstractInterpreter]: Visited 25 different actions 189 times. Merged at 9 different actions 144 times. Widened at 2 different actions 24 times. Performed 789 root evaluator evaluations with a maximum evaluation depth of 5. Performed 789 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-12 20:30:40,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:40,120 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 20:30:40,198 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 74.89% of their original sizes. [2018-11-12 20:30:40,198 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 20:30:40,520 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-12 20:30:40,521 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 20:30:40,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:30:40,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-12 20:30:40,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:40,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:30:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:30:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:30:40,524 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 11 states. [2018-11-12 20:30:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:42,287 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2018-11-12 20:30:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:30:42,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-12 20:30:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:42,290 INFO L225 Difference]: With dead ends: 135 [2018-11-12 20:30:42,291 INFO L226 Difference]: Without dead ends: 108 [2018-11-12 20:30:42,292 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:30:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-12 20:30:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 60. [2018-11-12 20:30:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:30:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-12 20:30:42,306 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 27 [2018-11-12 20:30:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:42,307 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-11-12 20:30:42,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:30:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-12 20:30:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:30:42,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:42,309 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:42,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:42,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash -277715294, now seen corresponding path program 1 times [2018-11-12 20:30:42,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:42,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:42,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:42,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:42,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:30:42,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:42,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:42,438 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-12 20:30:42,438 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [39], [43], [46], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:42,441 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:42,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:42,451 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:43,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:43,095 INFO L272 AbstractInterpreter]: Visited 33 different actions 678 times. Merged at 19 different actions 484 times. Widened at 5 different actions 89 times. Performed 2958 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 6 different actions. Largest state had 30 variables. [2018-11-12 20:30:43,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:43,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:43,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:43,135 INFO L192 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-12 20:30:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:43,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:43,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:43,423 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-12 20:30:43,437 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-12 20:30:43,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-12 20:30:44,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 15 treesize of output 11 [2018-11-12 20:30:44,060 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-12 20:30:44,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-12 20:30:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:30:44,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:30:44,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:30:44,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2018-11-12 20:30:44,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:44,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:30:44,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:30:44,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:30:44,426 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 7 states. [2018-11-12 20:30:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:44,832 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2018-11-12 20:30:44,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:30:44,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-12 20:30:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:44,834 INFO L225 Difference]: With dead ends: 85 [2018-11-12 20:30:44,834 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:30:44,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:30:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:30:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-12 20:30:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:30:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-12 20:30:44,844 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 37 [2018-11-12 20:30:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:44,845 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-12 20:30:44,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:30:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-12 20:30:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:30:44,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:44,847 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:44,847 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:44,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash 70555662, now seen corresponding path program 1 times [2018-11-12 20:30:44,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:44,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 20:30:45,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:45,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:45,068 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-12 20:30:45,068 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:45,071 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:45,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:45,080 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:45,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:45,815 INFO L272 AbstractInterpreter]: Visited 34 different actions 905 times. Merged at 24 different actions 667 times. Widened at 8 different actions 138 times. Performed 3796 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3796 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 110 fixpoints after 10 different actions. Largest state had 31 variables. [2018-11-12 20:30:45,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:45,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:45,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:45,854 INFO L192 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-12 20:30:45,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:45,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:45,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:46,052 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-12 20:30:46,063 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-12 20:30:46,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:46,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:46,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:46,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-12 20:30:46,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-12 20:30:46,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-12 20:30:46,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:46,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:46,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:46,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-12 20:30:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:30:46,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 20:30:46,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-12 20:30:46,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2018-11-12 20:30:46,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:46,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:30:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:30:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:30:46,483 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 7 states. [2018-11-12 20:30:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:46,766 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2018-11-12 20:30:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:30:46,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-12 20:30:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:46,769 INFO L225 Difference]: With dead ends: 91 [2018-11-12 20:30:46,769 INFO L226 Difference]: Without dead ends: 86 [2018-11-12 20:30:46,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:30:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-12 20:30:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-11-12 20:30:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:30:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-12 20:30:46,779 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 39 [2018-11-12 20:30:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:46,779 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-12 20:30:46,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:30:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-12 20:30:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-12 20:30:46,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:46,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:46,781 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:46,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:46,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1835157675, now seen corresponding path program 1 times [2018-11-12 20:30:46,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:46,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 20:30:46,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:46,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:46,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-12 20:30:46,905 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:46,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:46,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:46,914 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:47,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:47,575 INFO L272 AbstractInterpreter]: Visited 34 different actions 991 times. Merged at 24 different actions 705 times. Widened at 8 different actions 139 times. Performed 4268 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 112 fixpoints after 10 different actions. Largest state had 31 variables. [2018-11-12 20:30:47,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:47,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:47,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:47,603 INFO L192 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-12 20:30:47,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:47,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:47,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 20:30:47,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:30:48,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:48,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 9 [2018-11-12 20:30:48,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:48,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:30:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:30:48,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:30:48,003 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 6 states. [2018-11-12 20:30:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:48,316 INFO L93 Difference]: Finished difference Result 265 states and 355 transitions. [2018-11-12 20:30:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:30:48,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-12 20:30:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:48,321 INFO L225 Difference]: With dead ends: 265 [2018-11-12 20:30:48,321 INFO L226 Difference]: Without dead ends: 216 [2018-11-12 20:30:48,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:30:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-12 20:30:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 87. [2018-11-12 20:30:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:30:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2018-11-12 20:30:48,338 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 40 [2018-11-12 20:30:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2018-11-12 20:30:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:30:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2018-11-12 20:30:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-12 20:30:48,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:48,340 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:48,340 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:48,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1300112783, now seen corresponding path program 1 times [2018-11-12 20:30:48,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:48,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-12 20:30:48,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:48,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:48,437 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-12 20:30:48,438 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:48,439 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:48,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:48,446 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:49,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:49,189 INFO L272 AbstractInterpreter]: Visited 35 different actions 1135 times. Merged at 25 different actions 780 times. Widened at 8 different actions 146 times. Performed 4845 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4845 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 177 fixpoints after 11 different actions. Largest state had 31 variables. [2018-11-12 20:30:49,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:49,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:49,233 INFO L192 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-12 20:30:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:49,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:49,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-12 20:30:49,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 20:30:49,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:49,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 11] total 17 [2018-11-12 20:30:49,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:49,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:30:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:30:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:30:49,958 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 8 states. [2018-11-12 20:30:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:50,818 INFO L93 Difference]: Finished difference Result 471 states and 581 transitions. [2018-11-12 20:30:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:30:50,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-12 20:30:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:50,824 INFO L225 Difference]: With dead ends: 471 [2018-11-12 20:30:50,824 INFO L226 Difference]: Without dead ends: 398 [2018-11-12 20:30:50,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:30:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-11-12 20:30:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 119. [2018-11-12 20:30:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-12 20:30:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2018-11-12 20:30:50,850 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 47 [2018-11-12 20:30:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:50,850 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2018-11-12 20:30:50,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:30:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-11-12 20:30:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-12 20:30:50,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:50,853 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:50,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:50,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:50,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1770709481, now seen corresponding path program 2 times [2018-11-12 20:30:50,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:50,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:50,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:50,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:50,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 20:30:51,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:51,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:30:51,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:30:51,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:51,004 INFO L192 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-12 20:30:51,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:30:51,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:30:51,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:30:51,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:30:51,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:51,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-12 20:30:51,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:51,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-12 20:30:51,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:51,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:51,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:30:51,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-11-12 20:30:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 20:30:51,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:51,626 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:51,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:51,629 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-12 20:30:51,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:1 [2018-11-12 20:30:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 20:30:51,675 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:30:51,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [6] total 19 [2018-11-12 20:30:51,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:30:51,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:30:51,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:30:51,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:30:51,676 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 9 states. [2018-11-12 20:30:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:52,257 INFO L93 Difference]: Finished difference Result 202 states and 242 transitions. [2018-11-12 20:30:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:30:52,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-12 20:30:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:52,260 INFO L225 Difference]: With dead ends: 202 [2018-11-12 20:30:52,261 INFO L226 Difference]: Without dead ends: 165 [2018-11-12 20:30:52,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:30:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-12 20:30:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2018-11-12 20:30:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-12 20:30:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2018-11-12 20:30:52,280 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 53 [2018-11-12 20:30:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:52,280 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2018-11-12 20:30:52,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:30:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2018-11-12 20:30:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-12 20:30:52,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:52,283 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:52,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:52,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1319960000, now seen corresponding path program 1 times [2018-11-12 20:30:52,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:52,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:52,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:30:52,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:52,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:30:52,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:52,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:52,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-12 20:30:52,398 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:52,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:52,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:52,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:53,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:53,300 INFO L272 AbstractInterpreter]: Visited 41 different actions 1421 times. Merged at 31 different actions 1024 times. Widened at 11 different actions 210 times. Performed 5970 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 188 fixpoints after 12 different actions. Largest state had 35 variables. [2018-11-12 20:30:53,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:53,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:53,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:53,327 INFO L192 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-12 20:30:53,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:53,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:53,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:53,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-12 20:30:53,603 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 22 treesize of output 15 [2018-11-12 20:30:53,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:53,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-12 20:30:53,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:53,650 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-12 20:30:53,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:53,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:53,667 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-12 20:30:53,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-12 20:30:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:30:53,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:53,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-11-12 20:30:53,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 59 [2018-11-12 20:30:53,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-11-12 20:30:53,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-11-12 20:30:53,909 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:53,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-12 20:30:53,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:54,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:54,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:37 [2018-11-12 20:30:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:30:54,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:54,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2018-11-12 20:30:54,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:54,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:30:54,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:30:54,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:30:54,127 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand 14 states. [2018-11-12 20:30:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:55,160 INFO L93 Difference]: Finished difference Result 586 states and 725 transitions. [2018-11-12 20:30:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:30:55,165 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-11-12 20:30:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:55,168 INFO L225 Difference]: With dead ends: 586 [2018-11-12 20:30:55,168 INFO L226 Difference]: Without dead ends: 482 [2018-11-12 20:30:55,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:30:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-11-12 20:30:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 154. [2018-11-12 20:30:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-12 20:30:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2018-11-12 20:30:55,197 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 63 [2018-11-12 20:30:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:55,198 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2018-11-12 20:30:55,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:30:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2018-11-12 20:30:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-12 20:30:55,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:55,200 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:55,200 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:55,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -129841331, now seen corresponding path program 1 times [2018-11-12 20:30:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:55,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:55,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:30:55,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:55,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:55,447 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-12 20:30:55,447 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:55,449 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:55,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:55,455 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:56,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:56,732 INFO L272 AbstractInterpreter]: Visited 42 different actions 1801 times. Merged at 32 different actions 1262 times. Widened at 11 different actions 249 times. Performed 7807 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 292 fixpoints after 14 different actions. Largest state had 36 variables. [2018-11-12 20:30:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:56,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:56,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:56,773 INFO L192 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-12 20:30:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:56,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:56,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:57,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-12 20:30:57,315 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 22 treesize of output 15 [2018-11-12 20:30:57,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:57,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-12 20:30:57,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:57,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-12 20:30:57,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:57,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:57,353 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-12 20:30:57,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-12 20:30:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:30:57,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:57,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-12 20:30:57,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:30:57,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:57,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-12 20:30:57,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:57,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 65 [2018-11-12 20:30:57,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 7 xjuncts. [2018-11-12 20:30:57,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:57,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:57,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:61 [2018-11-12 20:30:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-12 20:30:57,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:57,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 25 [2018-11-12 20:30:57,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:57,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:30:57,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:30:57,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:30:57,844 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand 17 states. [2018-11-12 20:30:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:59,104 INFO L93 Difference]: Finished difference Result 899 states and 1123 transitions. [2018-11-12 20:30:59,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:30:59,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-12 20:30:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:59,109 INFO L225 Difference]: With dead ends: 899 [2018-11-12 20:30:59,109 INFO L226 Difference]: Without dead ends: 765 [2018-11-12 20:30:59,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:30:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-12 20:30:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 225. [2018-11-12 20:30:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-12 20:30:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 271 transitions. [2018-11-12 20:30:59,150 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 271 transitions. Word has length 66 [2018-11-12 20:30:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:59,150 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 271 transitions. [2018-11-12 20:30:59,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:30:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 271 transitions. [2018-11-12 20:30:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:30:59,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:59,152 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:59,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:59,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1377693540, now seen corresponding path program 1 times [2018-11-12 20:30:59,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:59,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:59,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:30:59,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:59,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:59,777 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-12 20:30:59,777 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:30:59,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:59,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:59,785 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:31:00,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:31:00,657 INFO L272 AbstractInterpreter]: Visited 41 different actions 1515 times. Merged at 31 different actions 1088 times. Widened at 11 different actions 223 times. Performed 6588 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6588 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 200 fixpoints after 13 different actions. Largest state had 36 variables. [2018-11-12 20:31:00,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:00,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:31:00,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:00,695 INFO L192 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-12 20:31:00,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:00,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:00,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-12 20:31:00,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:31:01,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:01,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 22 [2018-11-12 20:31:01,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:01,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:31:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:31:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:31:01,115 INFO L87 Difference]: Start difference. First operand 225 states and 271 transitions. Second operand 14 states. [2018-11-12 20:31:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:03,089 INFO L93 Difference]: Finished difference Result 1011 states and 1267 transitions. [2018-11-12 20:31:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:31:03,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-11-12 20:31:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:03,095 INFO L225 Difference]: With dead ends: 1011 [2018-11-12 20:31:03,095 INFO L226 Difference]: Without dead ends: 1003 [2018-11-12 20:31:03,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:31:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-12 20:31:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 444. [2018-11-12 20:31:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-12 20:31:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 542 transitions. [2018-11-12 20:31:03,166 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 542 transitions. Word has length 69 [2018-11-12 20:31:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:03,166 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 542 transitions. [2018-11-12 20:31:03,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:31:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 542 transitions. [2018-11-12 20:31:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:31:03,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:03,168 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:03,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:03,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1531070362, now seen corresponding path program 1 times [2018-11-12 20:31:03,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:03,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:03,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:03,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:03,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:03,891 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-11-12 20:31:04,205 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2018-11-12 20:31:04,588 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2018-11-12 20:31:05,069 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:31:05,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:05,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:05,070 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-12 20:31:05,070 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [62], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:31:05,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:31:05,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:31:05,077 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:31:06,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:31:06,026 INFO L272 AbstractInterpreter]: Visited 42 different actions 1674 times. Merged at 32 different actions 1176 times. Widened at 11 different actions 233 times. Performed 7259 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7259 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 259 fixpoints after 14 different actions. Largest state had 36 variables. [2018-11-12 20:31:06,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:06,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:31:06,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:06,063 INFO L192 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-12 20:31:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:06,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:06,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:06,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-11-12 20:31:06,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-12 20:31:06,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:06,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-12 20:31:06,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:06,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:06,957 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-12 20:31:06,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:4 [2018-11-12 20:31:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-12 20:31:06,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:07,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-12 20:31:07,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:31:07,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:07,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-12 20:31:07,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:07,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 71 [2018-11-12 20:31:07,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 7 xjuncts. [2018-11-12 20:31:07,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:07,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:07,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:73 [2018-11-12 20:31:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:31:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:07,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2018-11-12 20:31:07,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:07,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:31:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:31:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:31:07,428 INFO L87 Difference]: Start difference. First operand 444 states and 542 transitions. Second operand 24 states. [2018-11-12 20:31:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:10,888 INFO L93 Difference]: Finished difference Result 1166 states and 1454 transitions. [2018-11-12 20:31:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-12 20:31:10,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-11-12 20:31:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:10,893 INFO L225 Difference]: With dead ends: 1166 [2018-11-12 20:31:10,893 INFO L226 Difference]: Without dead ends: 1003 [2018-11-12 20:31:10,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=868, Invalid=5452, Unknown=0, NotChecked=0, Total=6320 [2018-11-12 20:31:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-12 20:31:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 699. [2018-11-12 20:31:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-12 20:31:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 844 transitions. [2018-11-12 20:31:11,016 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 844 transitions. Word has length 69 [2018-11-12 20:31:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:11,016 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 844 transitions. [2018-11-12 20:31:11,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:31:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 844 transitions. [2018-11-12 20:31:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:31:11,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:11,018 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:11,019 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:11,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1305306982, now seen corresponding path program 2 times [2018-11-12 20:31:11,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:11,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:11,957 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2018-11-12 20:31:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-12 20:31:12,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:12,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:12,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:12,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:12,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:12,568 INFO L192 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-12 20:31:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:12,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:12,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:31:12,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:12,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:13,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2018-11-12 20:31:13,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2018-11-12 20:31:13,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:13,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2018-11-12 20:31:13,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:13,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-11-12 20:31:13,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:13,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:13,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-12 20:31:13,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:57 [2018-11-12 20:31:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:31:13,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:14,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2018-11-12 20:31:14,175 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:14,177 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:14,188 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:14,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 155 [2018-11-12 20:31:14,255 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-12 20:31:14,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 35 xjuncts. [2018-11-12 20:31:14,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:14,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:14,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:14,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 87 [2018-11-12 20:31:14,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-12 20:31:14,643 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-12 20:31:14,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:14,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-12 20:31:14,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:14,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:14,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-12 20:31:14,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:88 [2018-11-12 20:31:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:31:14,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:14,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 41 [2018-11-12 20:31:14,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:14,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:31:14,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:31:14,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1366, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:31:14,866 INFO L87 Difference]: Start difference. First operand 699 states and 844 transitions. Second operand 29 states. [2018-11-12 20:31:17,653 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-12 20:31:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:19,063 INFO L93 Difference]: Finished difference Result 1522 states and 1872 transitions. [2018-11-12 20:31:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:31:19,063 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-11-12 20:31:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:19,068 INFO L225 Difference]: With dead ends: 1522 [2018-11-12 20:31:19,069 INFO L226 Difference]: Without dead ends: 1301 [2018-11-12 20:31:19,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1109, Invalid=5533, Unknown=0, NotChecked=0, Total=6642 [2018-11-12 20:31:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2018-11-12 20:31:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 641. [2018-11-12 20:31:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-11-12 20:31:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 762 transitions. [2018-11-12 20:31:19,214 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 762 transitions. Word has length 69 [2018-11-12 20:31:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:19,215 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 762 transitions. [2018-11-12 20:31:19,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:31:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 762 transitions. [2018-11-12 20:31:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-12 20:31:19,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:19,217 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:19,217 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:19,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:19,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2087146899, now seen corresponding path program 1 times [2018-11-12 20:31:19,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:19,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:19,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-12 20:31:19,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:19,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:19,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-12 20:31:19,573 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [30], [33], [35], [39], [43], [46], [48], [52], [55], [57], [60], [62], [64], [68], [72], [76], [78], [81], [83], [87], [90], [92], [95], [97], [99], [103], [110], [113], [115], [121], [122], [123], [125] [2018-11-12 20:31:19,574 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:31:19,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:31:19,581 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:31:20,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:31:20,589 INFO L272 AbstractInterpreter]: Visited 43 different actions 1815 times. Merged at 33 different actions 1243 times. Widened at 11 different actions 235 times. Performed 7844 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7844 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 339 fixpoints after 17 different actions. Largest state had 36 variables. [2018-11-12 20:31:20,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:20,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:31:20,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:20,627 INFO L192 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-12 20:31:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:20,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:20,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 20:31:20,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-12 20:31:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:20,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 10 [2018-11-12 20:31:20,946 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:20,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:31:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:31:20,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:31:20,947 INFO L87 Difference]: Start difference. First operand 641 states and 762 transitions. Second operand 7 states. [2018-11-12 20:31:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:21,313 INFO L93 Difference]: Finished difference Result 1431 states and 1711 transitions. [2018-11-12 20:31:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:31:21,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-11-12 20:31:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:21,322 INFO L225 Difference]: With dead ends: 1431 [2018-11-12 20:31:21,322 INFO L226 Difference]: Without dead ends: 852 [2018-11-12 20:31:21,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:31:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-11-12 20:31:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 589. [2018-11-12 20:31:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-11-12 20:31:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 667 transitions. [2018-11-12 20:31:21,460 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 667 transitions. Word has length 73 [2018-11-12 20:31:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:21,460 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 667 transitions. [2018-11-12 20:31:21,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:31:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 667 transitions. [2018-11-12 20:31:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-12 20:31:21,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:21,462 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:21,462 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:21,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1107939871, now seen corresponding path program 2 times [2018-11-12 20:31:21,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:21,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:21,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:22,130 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-12 20:31:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:31:22,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:22,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:22,245 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:22,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:22,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:22,246 INFO L192 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-12 20:31:22,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:22,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:22,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:31:22,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:22,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:31:22,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:22,563 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 22 treesize of output 18 [2018-11-12 20:31:22,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-12 20:31:22,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:22,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:22,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:22,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2018-11-12 20:31:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:31:22,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:22,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 20 [2018-11-12 20:31:22,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:22,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:31:22,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:31:22,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:31:22,704 INFO L87 Difference]: Start difference. First operand 589 states and 667 transitions. Second operand 13 states. [2018-11-12 20:31:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:23,164 INFO L93 Difference]: Finished difference Result 701 states and 788 transitions. [2018-11-12 20:31:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:31:23,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-11-12 20:31:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:23,169 INFO L225 Difference]: With dead ends: 701 [2018-11-12 20:31:23,170 INFO L226 Difference]: Without dead ends: 557 [2018-11-12 20:31:23,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 153 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:31:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-11-12 20:31:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-11-12 20:31:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-11-12 20:31:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 632 transitions. [2018-11-12 20:31:23,302 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 632 transitions. Word has length 83 [2018-11-12 20:31:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:23,303 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 632 transitions. [2018-11-12 20:31:23,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:31:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 632 transitions. [2018-11-12 20:31:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-12 20:31:23,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:23,305 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:23,305 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:23,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1745194953, now seen corresponding path program 3 times [2018-11-12 20:31:23,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:23,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:23,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:23,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:23,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:23,920 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-11-12 20:31:24,274 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-11-12 20:31:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-12 20:31:24,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:24,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:24,358 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:24,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:24,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:24,359 INFO L192 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-12 20:31:24,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:24,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:24,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:24,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:24,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:25,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2018-11-12 20:31:25,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-12 20:31:25,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:25,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:25,049 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-12 20:31:25,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:4 [2018-11-12 20:31:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:31:25,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:26,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-11-12 20:31:26,066 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 39 treesize of output 31 [2018-11-12 20:31:26,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:26,134 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:26,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-12 20:31:26,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:26,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:26,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-12 20:31:26,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:26,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:26,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:26,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:42 [2018-11-12 20:31:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-12 20:31:26,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:26,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 16] total 38 [2018-11-12 20:31:26,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:26,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:31:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:31:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:31:26,294 INFO L87 Difference]: Start difference. First operand 557 states and 632 transitions. Second operand 25 states. [2018-11-12 20:31:27,549 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-12 20:31:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:28,943 INFO L93 Difference]: Finished difference Result 1383 states and 1566 transitions. [2018-11-12 20:31:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:31:28,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-11-12 20:31:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:28,948 INFO L225 Difference]: With dead ends: 1383 [2018-11-12 20:31:28,948 INFO L226 Difference]: Without dead ends: 1378 [2018-11-12 20:31:28,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2018-11-12 20:31:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2018-11-12 20:31:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 607. [2018-11-12 20:31:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-12 20:31:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 682 transitions. [2018-11-12 20:31:29,151 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 682 transitions. Word has length 85 [2018-11-12 20:31:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:29,151 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 682 transitions. [2018-11-12 20:31:29,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:31:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 682 transitions. [2018-11-12 20:31:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:31:29,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:29,153 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:29,153 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:29,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:29,153 INFO L82 PathProgramCache]: Analyzing trace with hash -654345900, now seen corresponding path program 4 times [2018-11-12 20:31:29,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:29,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:29,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:29,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:29,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-12 20:31:29,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:29,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:29,368 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:29,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:29,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:29,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:29,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:29,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-12 20:31:29,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-12 20:31:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:29,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 23 [2018-11-12 20:31:29,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:29,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:31:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:31:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:31:29,844 INFO L87 Difference]: Start difference. First operand 607 states and 682 transitions. Second operand 14 states. [2018-11-12 20:31:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:30,815 INFO L93 Difference]: Finished difference Result 1698 states and 1911 transitions. [2018-11-12 20:31:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:31:30,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-11-12 20:31:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:30,827 INFO L225 Difference]: With dead ends: 1698 [2018-11-12 20:31:30,827 INFO L226 Difference]: Without dead ends: 1600 [2018-11-12 20:31:30,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:31:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2018-11-12 20:31:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 642. [2018-11-12 20:31:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-12 20:31:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 720 transitions. [2018-11-12 20:31:30,994 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 720 transitions. Word has length 86 [2018-11-12 20:31:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:30,994 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 720 transitions. [2018-11-12 20:31:30,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:31:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 720 transitions. [2018-11-12 20:31:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-12 20:31:30,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:30,996 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:30,996 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:30,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 396530945, now seen corresponding path program 5 times [2018-11-12 20:31:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:30,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:30,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:32,109 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-11-12 20:31:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-12 20:31:32,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:32,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:32,137 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:32,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:32,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:32,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:32,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:32,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:32,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:31:32,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:32,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:32,564 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 24 treesize of output 18 [2018-11-12 20:31:32,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:31:32,569 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:32,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-12 20:31:32,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:32,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:32,589 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-12 20:31:32,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2018-11-12 20:31:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-12 20:31:32,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-12 20:31:33,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:33,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 29 [2018-11-12 20:31:33,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:33,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:31:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:31:33,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:31:33,506 INFO L87 Difference]: Start difference. First operand 642 states and 720 transitions. Second operand 21 states. [2018-11-12 20:31:36,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:36,040 INFO L93 Difference]: Finished difference Result 3206 states and 3624 transitions. [2018-11-12 20:31:36,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:31:36,040 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-11-12 20:31:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:36,049 INFO L225 Difference]: With dead ends: 3206 [2018-11-12 20:31:36,049 INFO L226 Difference]: Without dead ends: 2583 [2018-11-12 20:31:36,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:31:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2018-11-12 20:31:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 738. [2018-11-12 20:31:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-12 20:31:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 824 transitions. [2018-11-12 20:31:36,280 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 824 transitions. Word has length 89 [2018-11-12 20:31:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:36,281 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 824 transitions. [2018-11-12 20:31:36,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:31:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 824 transitions. [2018-11-12 20:31:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:31:36,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:36,283 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:36,284 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:36,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -893091708, now seen corresponding path program 6 times [2018-11-12 20:31:36,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:36,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:36,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:36,897 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:31:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 59 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-12 20:31:38,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:38,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:38,165 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:38,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:38,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:38,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:38,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:38,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:38,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:38,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:38,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:38,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-12 20:31:38,417 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:38,418 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 20 treesize of output 15 [2018-11-12 20:31:38,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:38,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:38,436 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-12 20:31:38,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-11-12 20:31:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-12 20:31:38,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:38,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-12 20:31:38,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:31:38,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:38,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-12 20:31:38,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:38,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 65 [2018-11-12 20:31:38,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 7 xjuncts. [2018-11-12 20:31:38,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:38,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:38,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:61 [2018-11-12 20:31:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 31 proven. 48 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 20:31:38,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:38,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 11] total 34 [2018-11-12 20:31:38,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:38,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:31:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:31:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:31:38,850 INFO L87 Difference]: Start difference. First operand 738 states and 824 transitions. Second operand 26 states. [2018-11-12 20:31:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:40,651 INFO L93 Difference]: Finished difference Result 2754 states and 3093 transitions. [2018-11-12 20:31:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:31:40,652 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-11-12 20:31:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:40,659 INFO L225 Difference]: With dead ends: 2754 [2018-11-12 20:31:40,659 INFO L226 Difference]: Without dead ends: 2625 [2018-11-12 20:31:40,660 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 181 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:31:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2018-11-12 20:31:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 1083. [2018-11-12 20:31:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-11-12 20:31:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1206 transitions. [2018-11-12 20:31:40,976 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1206 transitions. Word has length 99 [2018-11-12 20:31:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:40,976 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 1206 transitions. [2018-11-12 20:31:40,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:31:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1206 transitions. [2018-11-12 20:31:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:31:40,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:40,979 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:40,979 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:40,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash -348786812, now seen corresponding path program 7 times [2018-11-12 20:31:40,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:40,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:40,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:40,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:40,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:41,573 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:31:41,786 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:31:42,202 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-12 20:31:42,596 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2018-11-12 20:31:42,742 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2018-11-12 20:31:42,874 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-11-12 20:31:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 74 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-12 20:31:43,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:43,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:43,653 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:43,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:43,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:43,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:43,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:31:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:43,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:44,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-12 20:31:44,144 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 24 treesize of output 17 [2018-11-12 20:31:44,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:44,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:44,160 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-12 20:31:44,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:44,177 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:44,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-12 20:31:44,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:44,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:44,195 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-12 20:31:44,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2018-11-12 20:31:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 91 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-12 20:31:44,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:44,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2018-11-12 20:31:44,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 71 [2018-11-12 20:31:44,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-11-12 20:31:44,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-12 20:31:44,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:44,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-12 20:31:44,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:44,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:44,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:44,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:71 [2018-11-12 20:31:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 20:31:44,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:44,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 13] total 41 [2018-11-12 20:31:44,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:44,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:31:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:31:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:31:44,739 INFO L87 Difference]: Start difference. First operand 1083 states and 1206 transitions. Second operand 31 states. [2018-11-12 20:31:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:47,674 INFO L93 Difference]: Finished difference Result 3566 states and 3995 transitions. [2018-11-12 20:31:47,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:31:47,674 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 99 [2018-11-12 20:31:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:47,683 INFO L225 Difference]: With dead ends: 3566 [2018-11-12 20:31:47,683 INFO L226 Difference]: Without dead ends: 3281 [2018-11-12 20:31:47,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 176 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=470, Invalid=2722, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:31:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2018-11-12 20:31:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 1435. [2018-11-12 20:31:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-11-12 20:31:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1595 transitions. [2018-11-12 20:31:48,058 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1595 transitions. Word has length 99 [2018-11-12 20:31:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:48,059 INFO L480 AbstractCegarLoop]: Abstraction has 1435 states and 1595 transitions. [2018-11-12 20:31:48,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:31:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1595 transitions. [2018-11-12 20:31:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:31:48,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:48,062 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:48,063 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:48,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:48,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1504345528, now seen corresponding path program 8 times [2018-11-12 20:31:48,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:48,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:48,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:48,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:48,622 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:31:49,257 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 47 [2018-11-12 20:31:49,395 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2018-11-12 20:31:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 20 proven. 74 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-12 20:31:50,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:50,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:50,030 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:50,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:50,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:50,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:50,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:31:50,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:31:50,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:31:50,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:50,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:50,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:31:50,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:31:50,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-12 20:31:50,435 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 41 [2018-11-12 20:31:50,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-11-12 20:31:50,466 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:50,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-12 20:31:50,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:50,469 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 14 treesize of output 6 [2018-11-12 20:31:50,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:50,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:50,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:50,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2018-11-12 20:31:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 7 proven. 80 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-12 20:31:50,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:51,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2018-11-12 20:31:51,126 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:51,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:51,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-12 20:31:51,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:51,168 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:51,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:31:51,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2018-11-12 20:31:51,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:51,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:51,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-12 20:31:51,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:43 [2018-11-12 20:31:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 7 proven. 74 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-12 20:31:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 13] total 41 [2018-11-12 20:31:51,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:51,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:31:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:31:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:31:51,353 INFO L87 Difference]: Start difference. First operand 1435 states and 1595 transitions. Second operand 30 states. [2018-11-12 20:31:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:56,538 INFO L93 Difference]: Finished difference Result 3370 states and 3757 transitions. [2018-11-12 20:31:56,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:31:56,539 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 99 [2018-11-12 20:31:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:56,552 INFO L225 Difference]: With dead ends: 3370 [2018-11-12 20:31:56,552 INFO L226 Difference]: Without dead ends: 3273 [2018-11-12 20:31:56,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 177 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1116, Invalid=6540, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:31:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2018-11-12 20:31:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 1507. [2018-11-12 20:31:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-12 20:31:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1675 transitions. [2018-11-12 20:31:56,998 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1675 transitions. Word has length 99 [2018-11-12 20:31:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:56,999 INFO L480 AbstractCegarLoop]: Abstraction has 1507 states and 1675 transitions. [2018-11-12 20:31:56,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:31:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1675 transitions. [2018-11-12 20:31:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:31:57,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:57,002 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:31:57,002 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:57,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -225111736, now seen corresponding path program 9 times [2018-11-12 20:31:57,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:57,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:31:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:57,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:57,567 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:31:58,143 WARN L179 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-11-12 20:31:58,325 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2018-11-12 20:31:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-12 20:31:58,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:58,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:31:58,908 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:31:58,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:31:58,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:31:58,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:31:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:31:58,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:31:58,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:31:58,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:31:58,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:31:59,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:31:59,112 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:59,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-12 20:31:59,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:59,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:59,129 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-12 20:31:59,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-12 20:31:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-12 20:31:59,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:31:59,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-12 20:31:59,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 71 [2018-11-12 20:31:59,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-11-12 20:31:59,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:31:59,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:59,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-12 20:31:59,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:59,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:59,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:31:59,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:73 [2018-11-12 20:31:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 31 proven. 48 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 20:31:59,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:59,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 28 [2018-11-12 20:31:59,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:59,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:31:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:31:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:31:59,629 INFO L87 Difference]: Start difference. First operand 1507 states and 1675 transitions. Second operand 20 states. [2018-11-12 20:32:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:00,608 INFO L93 Difference]: Finished difference Result 1835 states and 2031 transitions. [2018-11-12 20:32:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:32:00,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-11-12 20:32:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:00,613 INFO L225 Difference]: With dead ends: 1835 [2018-11-12 20:32:00,614 INFO L226 Difference]: Without dead ends: 1714 [2018-11-12 20:32:00,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 182 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:32:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2018-11-12 20:32:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1507. [2018-11-12 20:32:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-12 20:32:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1664 transitions. [2018-11-12 20:32:00,986 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1664 transitions. Word has length 99 [2018-11-12 20:32:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:00,986 INFO L480 AbstractCegarLoop]: Abstraction has 1507 states and 1664 transitions. [2018-11-12 20:32:00,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:32:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1664 transitions. [2018-11-12 20:32:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-12 20:32:00,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:00,989 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:00,989 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:00,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash 888946310, now seen corresponding path program 10 times [2018-11-12 20:32:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:00,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:00,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-12 20:32:01,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:01,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:01,672 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:01,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:01,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:01,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:01,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:01,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:01,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:02,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2018-11-12 20:32:02,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2018-11-12 20:32:02,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:02,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2018-11-12 20:32:02,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:02,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-11-12 20:32:02,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:02,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:32:02,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:02,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:65, output treesize:4 [2018-11-12 20:32:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 28 proven. 35 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-12 20:32:02,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:02,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2018-11-12 20:32:02,859 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:02,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:02,873 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:02,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 167 [2018-11-12 20:32:02,956 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-12 20:32:02,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 35 xjuncts. [2018-11-12 20:32:03,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2018-11-12 20:32:03,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:32:03,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:03,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:03,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-12 20:32:03,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:03,304 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:03,307 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:03,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:03,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 86 [2018-11-12 20:32:03,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-12 20:32:03,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:32:03,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-12 20:32:03,569 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:76, output treesize:105 [2018-11-12 20:32:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-12 20:32:03,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:03,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 13] total 35 [2018-11-12 20:32:03,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:03,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:32:03,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:32:03,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:32:03,682 INFO L87 Difference]: Start difference. First operand 1507 states and 1664 transitions. Second operand 25 states. [2018-11-12 20:32:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:12,775 INFO L93 Difference]: Finished difference Result 3593 states and 3976 transitions. [2018-11-12 20:32:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-12 20:32:12,776 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-12 20:32:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:12,784 INFO L225 Difference]: With dead ends: 3593 [2018-11-12 20:32:12,784 INFO L226 Difference]: Without dead ends: 3200 [2018-11-12 20:32:12,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9035 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1915, Invalid=25145, Unknown=0, NotChecked=0, Total=27060 [2018-11-12 20:32:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2018-11-12 20:32:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 1964. [2018-11-12 20:32:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2018-11-12 20:32:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2166 transitions. [2018-11-12 20:32:13,315 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2166 transitions. Word has length 99 [2018-11-12 20:32:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:13,315 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 2166 transitions. [2018-11-12 20:32:13,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:32:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2166 transitions. [2018-11-12 20:32:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-12 20:32:13,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:13,319 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 20:32:13,319 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:13,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1068781972, now seen corresponding path program 11 times [2018-11-12 20:32:13,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:13,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:13,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 60 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-12 20:32:14,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:14,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:14,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:14,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:14,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:14,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:14,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:14,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:32:14,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:14,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 60 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-12 20:32:14,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 60 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-12 20:32:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:14,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2018-11-12 20:32:14,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:14,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:32:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:32:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:32:14,555 INFO L87 Difference]: Start difference. First operand 1964 states and 2166 transitions. Second operand 12 states. [2018-11-12 20:32:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:15,760 INFO L93 Difference]: Finished difference Result 4240 states and 4677 transitions. [2018-11-12 20:32:15,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:32:15,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2018-11-12 20:32:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:15,769 INFO L225 Difference]: With dead ends: 4240 [2018-11-12 20:32:15,769 INFO L226 Difference]: Without dead ends: 2506 [2018-11-12 20:32:15,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 215 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:32:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-12 20:32:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2089. [2018-11-12 20:32:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2018-11-12 20:32:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2300 transitions. [2018-11-12 20:32:16,419 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2300 transitions. Word has length 112 [2018-11-12 20:32:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:16,419 INFO L480 AbstractCegarLoop]: Abstraction has 2089 states and 2300 transitions. [2018-11-12 20:32:16,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:32:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2300 transitions. [2018-11-12 20:32:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 20:32:16,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:16,422 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 20:32:16,422 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:16,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash -819368957, now seen corresponding path program 12 times [2018-11-12 20:32:16,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:16,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:16,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:16,946 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:32:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 63 proven. 45 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-12 20:32:17,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:17,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:17,296 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:17,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:17,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:17,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:17,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:17,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:17,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:17,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:17,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:17,556 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-12 20:32:17,557 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-12 20:32:17,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:17,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:17,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:17,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-12 20:32:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 63 proven. 98 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:32:17,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:17,674 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 22 treesize of output 18 [2018-11-12 20:32:17,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-12 20:32:17,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:17,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:17,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:17,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2018-11-12 20:32:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 63 proven. 45 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-12 20:32:17,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:17,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 35 [2018-11-12 20:32:17,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:17,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:32:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:32:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:32:17,774 INFO L87 Difference]: Start difference. First operand 2089 states and 2300 transitions. Second operand 27 states. [2018-11-12 20:32:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:19,592 INFO L93 Difference]: Finished difference Result 2446 states and 2666 transitions. [2018-11-12 20:32:19,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:32:19,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2018-11-12 20:32:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:19,598 INFO L225 Difference]: With dead ends: 2446 [2018-11-12 20:32:19,599 INFO L226 Difference]: Without dead ends: 2060 [2018-11-12 20:32:19,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 205 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:32:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2018-11-12 20:32:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1964. [2018-11-12 20:32:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2018-11-12 20:32:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2165 transitions. [2018-11-12 20:32:20,191 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2165 transitions. Word has length 113 [2018-11-12 20:32:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:20,191 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 2165 transitions. [2018-11-12 20:32:20,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:32:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2165 transitions. [2018-11-12 20:32:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-12 20:32:20,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:20,194 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-12 20:32:20,194 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:20,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash -249299199, now seen corresponding path program 13 times [2018-11-12 20:32:20,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:20,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:20,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-11-12 20:32:21,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:21,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:21,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:21,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:21,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:21,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:21,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:21,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:21,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:21,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2018-11-12 20:32:21,612 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 30 treesize of output 23 [2018-11-12 20:32:21,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:21,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-12 20:32:21,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:21,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:21,635 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-12 20:32:21,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:4 [2018-11-12 20:32:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-12 20:32:21,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:22,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-11-12 20:32:22,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:22,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-12 20:32:22,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:22,294 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:22,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-12 20:32:22,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:22,319 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 26 treesize of output 20 [2018-11-12 20:32:22,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:22,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:32:22,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:32:22,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:42 [2018-11-12 20:32:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 54 proven. 94 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-12 20:32:22,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:22,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 18] total 45 [2018-11-12 20:32:22,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:22,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:32:22,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:32:22,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:32:22,475 INFO L87 Difference]: Start difference. First operand 1964 states and 2165 transitions. Second operand 30 states. [2018-11-12 20:32:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:25,584 INFO L93 Difference]: Finished difference Result 2984 states and 3286 transitions. [2018-11-12 20:32:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:32:25,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 115 [2018-11-12 20:32:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:25,589 INFO L225 Difference]: With dead ends: 2984 [2018-11-12 20:32:25,589 INFO L226 Difference]: Without dead ends: 2979 [2018-11-12 20:32:25,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=916, Invalid=4196, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:32:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2018-11-12 20:32:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2032. [2018-11-12 20:32:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2018-11-12 20:32:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2233 transitions. [2018-11-12 20:32:26,193 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2233 transitions. Word has length 115 [2018-11-12 20:32:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:26,194 INFO L480 AbstractCegarLoop]: Abstraction has 2032 states and 2233 transitions. [2018-11-12 20:32:26,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:32:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2233 transitions. [2018-11-12 20:32:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-12 20:32:26,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:26,196 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:26,196 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:26,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash 964729635, now seen corresponding path program 14 times [2018-11-12 20:32:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:26,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-11-12 20:32:26,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:26,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:26,570 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:26,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:26,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:26,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:26,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:26,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:32:26,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:26,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-12 20:32:27,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 67 proven. 69 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-12 20:32:27,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:27,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 13] total 38 [2018-11-12 20:32:27,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:27,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:32:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:32:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:32:27,791 INFO L87 Difference]: Start difference. First operand 2032 states and 2233 transitions. Second operand 27 states. [2018-11-12 20:32:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:31,401 INFO L93 Difference]: Finished difference Result 4853 states and 5337 transitions. [2018-11-12 20:32:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:32:31,401 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 119 [2018-11-12 20:32:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:31,408 INFO L225 Difference]: With dead ends: 4853 [2018-11-12 20:32:31,409 INFO L226 Difference]: Without dead ends: 4606 [2018-11-12 20:32:31,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=491, Invalid=2931, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:32:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2018-11-12 20:32:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 1967. [2018-11-12 20:32:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-11-12 20:32:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2159 transitions. [2018-11-12 20:32:32,204 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2159 transitions. Word has length 119 [2018-11-12 20:32:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:32,204 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 2159 transitions. [2018-11-12 20:32:32,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:32:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2159 transitions. [2018-11-12 20:32:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:32:32,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:32,207 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:32,207 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:32,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash -764154436, now seen corresponding path program 15 times [2018-11-12 20:32:32,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:32,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:32,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 151 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-12 20:32:33,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:33,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:33,773 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:33,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:33,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:33,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:32:33,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:32:33,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:32:33,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:33,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:34,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-12 20:32:34,275 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 22 treesize of output 15 [2018-11-12 20:32:34,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:34,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-12 20:32:34,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:34,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:34,309 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-12 20:32:34,309 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-12 20:32:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 190 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-12 20:32:34,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:34,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-12 20:32:34,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 65 [2018-11-12 20:32:34,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-11-12 20:32:34,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:32:34,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:32:34,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-12 20:32:34,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:34,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:32:34,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:32:34,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:61 [2018-11-12 20:32:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 53 proven. 149 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-12 20:32:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 35 [2018-11-12 20:32:34,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:34,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:32:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:32:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:32:34,876 INFO L87 Difference]: Start difference. First operand 1967 states and 2159 transitions. Second operand 25 states. [2018-11-12 20:32:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:36,751 INFO L93 Difference]: Finished difference Result 3687 states and 4070 transitions. [2018-11-12 20:32:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:32:36,751 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2018-11-12 20:32:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:36,757 INFO L225 Difference]: With dead ends: 3687 [2018-11-12 20:32:36,757 INFO L226 Difference]: Without dead ends: 3526 [2018-11-12 20:32:36,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 237 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:32:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2018-11-12 20:32:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 2993. [2018-11-12 20:32:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2018-11-12 20:32:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 3287 transitions. [2018-11-12 20:32:37,851 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 3287 transitions. Word has length 129 [2018-11-12 20:32:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:37,851 INFO L480 AbstractCegarLoop]: Abstraction has 2993 states and 3287 transitions. [2018-11-12 20:32:37,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:32:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 3287 transitions. [2018-11-12 20:32:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:32:37,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:37,855 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:37,856 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:37,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash -63497028, now seen corresponding path program 16 times [2018-11-12 20:32:37,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:37,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:32:37,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:37,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:38,542 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:32:38,753 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:32:39,177 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-11-12 20:32:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 32 proven. 176 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-12 20:32:39,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:39,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:39,942 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:39,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:39,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:39,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:39,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:39,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:32:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:40,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:40,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-12 20:32:40,381 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 22 treesize of output 15 [2018-11-12 20:32:40,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:40,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-12 20:32:40,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:40,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-12 20:32:40,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:40,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:40,416 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-12 20:32:40,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-12 20:32:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 32 proven. 222 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-12 20:32:40,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:40,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2018-11-12 20:32:40,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 71 [2018-11-12 20:32:40,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2018-11-12 20:32:40,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-12 20:32:40,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:32:40,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-12 20:32:40,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:40,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:32:40,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:32:40,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:71 [2018-11-12 20:32:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 32 proven. 176 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-12 20:32:41,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:41,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 15] total 41 [2018-11-12 20:32:41,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:41,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:32:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:32:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:32:41,080 INFO L87 Difference]: Start difference. First operand 2993 states and 3287 transitions. Second operand 29 states. [2018-11-12 20:32:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:32:43,914 INFO L93 Difference]: Finished difference Result 4993 states and 5489 transitions. [2018-11-12 20:32:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:32:43,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2018-11-12 20:32:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:32:43,920 INFO L225 Difference]: With dead ends: 4993 [2018-11-12 20:32:43,921 INFO L226 Difference]: Without dead ends: 4716 [2018-11-12 20:32:43,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 232 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:32:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2018-11-12 20:32:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4195. [2018-11-12 20:32:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2018-11-12 20:32:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 4599 transitions. [2018-11-12 20:32:45,438 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 4599 transitions. Word has length 129 [2018-11-12 20:32:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:32:45,438 INFO L480 AbstractCegarLoop]: Abstraction has 4195 states and 4599 transitions. [2018-11-12 20:32:45,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:32:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 4599 transitions. [2018-11-12 20:32:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:32:45,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:32:45,443 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:32:45,443 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:32:45,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:32:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 939254784, now seen corresponding path program 17 times [2018-11-12 20:32:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:32:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:32:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:32:45,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:32:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:32:46,284 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-12 20:32:46,536 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-11-12 20:32:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 32 proven. 176 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-12 20:32:47,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:32:47,467 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:32:47,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:32:47,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:32:47,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:32:47,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:32:47,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:32:47,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:32:47,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:32:47,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:32:47,638 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-12 20:32:47,639 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-12 20:32:47,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:47,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:47,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:47,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-11-12 20:32:49,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 55 [2018-11-12 20:32:49,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:49,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:49,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-11-12 20:32:49,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:49,580 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:49,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-12 20:32:49,581 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:49,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:49,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:49,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:32:49,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:32:49,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 93 [2018-11-12 20:32:49,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:32:49,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:32:49,700 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-12 20:32:49,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:96, output treesize:15 [2018-11-12 20:32:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 112 proven. 93 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-12 20:32:49,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:32:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 11 proven. 180 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-12 20:32:54,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:32:54,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 25] total 65 [2018-11-12 20:32:54,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:32:54,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:32:54,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:32:54,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3598, Unknown=1, NotChecked=0, Total=4160 [2018-11-12 20:32:54,652 INFO L87 Difference]: Start difference. First operand 4195 states and 4599 transitions. Second operand 42 states. [2018-11-12 20:32:58,333 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-12 20:32:58,797 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-11-12 20:32:59,276 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-12 20:33:00,052 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-11-12 20:33:00,390 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-11-12 20:33:00,773 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-11-12 20:33:01,424 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-11-12 20:33:01,953 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-11-12 20:33:02,264 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2018-11-12 20:33:02,598 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-11-12 20:33:02,847 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2018-11-12 20:33:03,143 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2018-11-12 20:33:03,881 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-11-12 20:33:04,781 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-11-12 20:33:05,418 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-12 20:33:06,420 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-11-12 20:33:07,087 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-12 20:33:07,754 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-11-12 20:33:08,705 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-11-12 20:33:31,730 WARN L179 SmtUtils]: Spent 22.56 s on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-11-12 20:33:32,890 WARN L179 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-11-12 20:33:33,119 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-12 20:33:37,791 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-11-12 20:33:38,351 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-12 20:33:39,131 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-11-12 20:33:41,430 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-11-12 20:33:42,375 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-12 20:33:42,968 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-11-12 20:33:43,596 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-11-12 20:33:44,127 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2018-11-12 20:33:44,435 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2018-11-12 20:33:44,696 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-12 20:33:45,046 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-11-12 20:33:45,512 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-11-12 20:33:47,826 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-12 20:33:48,243 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-12 20:33:48,803 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2018-11-12 20:33:49,781 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-12 20:33:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:55,800 INFO L93 Difference]: Finished difference Result 17103 states and 18916 transitions. [2018-11-12 20:33:55,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-11-12 20:33:55,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 129 [2018-11-12 20:33:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:55,812 INFO L225 Difference]: With dead ends: 17103 [2018-11-12 20:33:55,812 INFO L226 Difference]: Without dead ends: 14696 [2018-11-12 20:33:55,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9293 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=4610, Invalid=27251, Unknown=1, NotChecked=0, Total=31862 [2018-11-12 20:33:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14696 states. [2018-11-12 20:33:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14696 to 6830. [2018-11-12 20:33:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6830 states. [2018-11-12 20:33:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 7633 transitions. [2018-11-12 20:33:58,152 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 7633 transitions. Word has length 129 [2018-11-12 20:33:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:58,153 INFO L480 AbstractCegarLoop]: Abstraction has 6830 states and 7633 transitions. [2018-11-12 20:33:58,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:33:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 7633 transitions. [2018-11-12 20:33:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:33:58,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:58,161 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:58,161 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:58,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:58,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478720, now seen corresponding path program 18 times [2018-11-12 20:33:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:58,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:58,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 151 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-12 20:33:59,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:59,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:59,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:59,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:59,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:59,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:59,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:59,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:59,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:59,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:59,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:33:59,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:33:59,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-12 20:33:59,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:33:59,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-12 20:33:59,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:33:59,502 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:33:59,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-12 20:33:59,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:33:59,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:33:59,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-12 20:33:59,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-12 20:33:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 52 proven. 190 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-12 20:33:59,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:59,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-12 20:33:59,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-12 20:33:59,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:33:59,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 71 [2018-11-12 20:33:59,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2018-11-12 20:33:59,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-12 20:33:59,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:33:59,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:33:59,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:33:59,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:73 [2018-11-12 20:34:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 53 proven. 149 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-12 20:34:00,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:00,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 33 [2018-11-12 20:34:00,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:00,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:34:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:34:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:34:00,066 INFO L87 Difference]: Start difference. First operand 6830 states and 7633 transitions. Second operand 23 states. [2018-11-12 20:34:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:03,594 INFO L93 Difference]: Finished difference Result 7426 states and 8269 transitions. [2018-11-12 20:34:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:34:03,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-11-12 20:34:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:03,599 INFO L225 Difference]: With dead ends: 7426 [2018-11-12 20:34:03,600 INFO L226 Difference]: Without dead ends: 7265 [2018-11-12 20:34:03,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 238 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:34:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2018-11-12 20:34:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 6830. [2018-11-12 20:34:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6830 states. [2018-11-12 20:34:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 7619 transitions. [2018-11-12 20:34:06,120 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 7619 transitions. Word has length 129 [2018-11-12 20:34:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:06,120 INFO L480 AbstractCegarLoop]: Abstraction has 6830 states and 7619 transitions. [2018-11-12 20:34:06,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:34:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 7619 transitions. [2018-11-12 20:34:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-12 20:34:06,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:06,128 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:06,128 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:06,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:06,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1573362942, now seen corresponding path program 19 times [2018-11-12 20:34:06,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:06,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:06,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-12 20:34:06,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:06,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:06,674 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:06,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:06,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:06,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:06,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:06,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:06,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 237 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-12 20:34:06,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-12 20:34:07,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:07,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 14] total 34 [2018-11-12 20:34:07,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:07,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:34:07,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:34:07,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:34:07,260 INFO L87 Difference]: Start difference. First operand 6830 states and 7619 transitions. Second operand 22 states. [2018-11-12 20:34:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:17,477 INFO L93 Difference]: Finished difference Result 13119 states and 14547 transitions. [2018-11-12 20:34:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-11-12 20:34:17,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 129 [2018-11-12 20:34:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:17,486 INFO L225 Difference]: With dead ends: 13119 [2018-11-12 20:34:17,486 INFO L226 Difference]: Without dead ends: 13113 [2018-11-12 20:34:17,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3399 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=679, Invalid=11531, Unknown=0, NotChecked=0, Total=12210 [2018-11-12 20:34:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13113 states. [2018-11-12 20:34:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13113 to 9145. [2018-11-12 20:34:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9145 states. [2018-11-12 20:34:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9145 states to 9145 states and 10201 transitions. [2018-11-12 20:34:20,803 INFO L78 Accepts]: Start accepts. Automaton has 9145 states and 10201 transitions. Word has length 129 [2018-11-12 20:34:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:20,803 INFO L480 AbstractCegarLoop]: Abstraction has 9145 states and 10201 transitions. [2018-11-12 20:34:20,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:34:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 9145 states and 10201 transitions. [2018-11-12 20:34:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 20:34:20,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:20,813 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 8, 8, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:20,814 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:20,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1688453066, now seen corresponding path program 20 times [2018-11-12 20:34:20,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:20,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:20,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 111 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-12 20:34:21,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:21,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:21,153 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:21,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:21,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:21,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:21,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:21,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:21,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:34:21,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:21,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 144 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-12 20:34:21,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 89 proven. 111 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-12 20:34:21,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:21,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 23 [2018-11-12 20:34:21,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:21,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:34:21,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:34:21,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:34:21,940 INFO L87 Difference]: Start difference. First operand 9145 states and 10201 transitions. Second operand 18 states. [2018-11-12 20:34:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:25,699 INFO L93 Difference]: Finished difference Result 13120 states and 14273 transitions. [2018-11-12 20:34:25,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:34:25,700 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-11-12 20:34:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:25,705 INFO L225 Difference]: With dead ends: 13120 [2018-11-12 20:34:25,705 INFO L226 Difference]: Without dead ends: 7256 [2018-11-12 20:34:25,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 269 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:34:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2018-11-12 20:34:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 6153. [2018-11-12 20:34:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2018-11-12 20:34:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 6712 transitions. [2018-11-12 20:34:27,959 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 6712 transitions. Word has length 142 [2018-11-12 20:34:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:27,959 INFO L480 AbstractCegarLoop]: Abstraction has 6153 states and 6712 transitions. [2018-11-12 20:34:27,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:34:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 6712 transitions. [2018-11-12 20:34:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 20:34:27,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:27,967 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 8, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:27,967 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:27,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1289049915, now seen corresponding path program 21 times [2018-11-12 20:34:27,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:27,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:27,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:27,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:27,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 93 proven. 117 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-12 20:34:28,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:28,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:28,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:28,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:28,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:28,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:28,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:28,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:28,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:28,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:28,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:29,213 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-12 20:34:29,214 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-12 20:34:29,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:34:29,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:34:29,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:34:29,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-12 20:34:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 93 proven. 150 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-12 20:34:29,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:29,479 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 22 treesize of output 18 [2018-11-12 20:34:29,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-12 20:34:29,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:34:29,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:34:29,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:34:29,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2018-11-12 20:34:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 93 proven. 117 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-12 20:34:29,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:29,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 40 [2018-11-12 20:34:29,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:29,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:34:29,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:34:29,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:34:29,632 INFO L87 Difference]: Start difference. First operand 6153 states and 6712 transitions. Second operand 30 states. [2018-11-12 20:34:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:33,441 INFO L93 Difference]: Finished difference Result 7039 states and 7607 transitions. [2018-11-12 20:34:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:34:33,442 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2018-11-12 20:34:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:33,446 INFO L225 Difference]: With dead ends: 7039 [2018-11-12 20:34:33,446 INFO L226 Difference]: Without dead ends: 5924 [2018-11-12 20:34:33,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 262 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2018-11-12 20:34:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5924 states. Received shutdown request... [2018-11-12 20:34:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5924 to 5732. [2018-11-12 20:34:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5732 states. [2018-11-12 20:34:35,429 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:34:35,433 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:34:35,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:34:35 BoogieIcfgContainer [2018-11-12 20:34:35,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:34:35,434 INFO L168 Benchmark]: Toolchain (without parser) took 238056.54 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -847.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-12 20:34:35,434 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:35,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:35,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:35,435 INFO L168 Benchmark]: Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:34:35,435 INFO L168 Benchmark]: RCFGBuilder took 662.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -723.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:34:35,435 INFO L168 Benchmark]: TraceAbstraction took 236998.08 ms. Allocated memory was 2.2 GB in the beginning and 3.5 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -134.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-12 20:34:35,437 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 662.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -723.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236998.08 ms. Allocated memory was 2.2 GB in the beginning and 3.5 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -134.2 MB). Peak memory consumption was 1.8 GB. 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 ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. TIMEOUT Result, 236.9s OverallTime, 34 OverallIterations, 12 TraceHistogramMax, 140.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2718 SDtfs, 12475 SDslu, 26784 SDs, 0 SdLazy, 24015 SolverSat, 2712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 6837 GetRequests, 5159 SyntacticMatches, 127 SemanticMatches, 1551 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36426 ImplicationChecksByTransitivity, 123.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9145occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.0s AbstIntTime, 10 AbstIntIterations, 1 AbstIntStrong, 0.8680069930069932 AbsIntWeakeningRatio, 0.8461538461538461 AbsIntAvgWeakeningVarsNumRemoved, 5.730769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 31894 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 60.3s InterpolantComputationTime, 5773 NumberOfCodeBlocks, 5604 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 8529 ConstructedInterpolants, 311 QuantifiedInterpolants, 10070004 SizeOfPredicates, 302 NumberOfNonLiveVariables, 6722 ConjunctsInSsa, 1013 ConjunctsInUnsatCore, 96 InterpolantComputations, 6 PerfectInterpolantSequences, 8663/14474 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown