java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:33:07,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:33:07,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:33:07,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:33:07,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:33:07,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:33:07,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:33:07,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:33:07,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:33:07,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:33:07,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:33:07,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:33:07,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:33:07,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:33:07,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:33:07,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:33:07,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:33:07,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:33:07,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:33:07,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:33:07,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:33:07,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:33:07,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:33:07,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:33:07,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:33:07,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:33:07,684 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:33:07,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:33:07,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:33:07,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:33:07,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:33:07,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:33:07,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:33:07,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:33:07,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:33:07,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:33:07,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 22:33:07,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:33:07,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:33:07,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:33:07,711 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:33:07,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:33:07,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:33:07,712 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:33:07,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:33:07,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:33:07,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:33:07,713 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:33:07,713 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:33:07,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:33:07,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:33:07,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:33:07,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:33:07,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:33:07,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:33:07,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:33:07,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:33:07,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:33:07,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:33:07,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:33:07,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:33:07,716 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:33:07,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:33:07,716 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:33:07,717 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:33:07,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:33:07,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:33:07,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:33:07,781 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:33:07,781 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:33:07,782 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-26 22:33:07,838 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bfd6ec13b/cdef2167fbb24b0584dc04e4c266bf40/FLAGc4a2be726 [2018-10-26 22:33:08,250 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:33:08,251 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-26 22:33:08,258 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bfd6ec13b/cdef2167fbb24b0584dc04e4c266bf40/FLAGc4a2be726 [2018-10-26 22:33:08,274 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/bfd6ec13b/cdef2167fbb24b0584dc04e4c266bf40 [2018-10-26 22:33:08,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:33:08,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:33:08,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:33:08,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:33:08,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:33:08,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c75596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08, skipping insertion in model container [2018-10-26 22:33:08,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:33:08,330 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:33:08,538 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:33:08,553 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:33:08,578 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:33:08,598 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:33:08,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08 WrapperNode [2018-10-26 22:33:08,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:33:08,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:33:08,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:33:08,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:33:08,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:33:08,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:33:08,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:33:08,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:33:08,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... [2018-10-26 22:33:08,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:33:08,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:33:08,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:33:08,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:33:08,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:33:08,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:33:08,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:33:09,208 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:33:09,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:09 BoogieIcfgContainer [2018-10-26 22:33:09,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:33:09,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:33:09,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:33:09,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:33:09,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:33:08" (1/3) ... [2018-10-26 22:33:09,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d046e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:09, skipping insertion in model container [2018-10-26 22:33:09,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:33:08" (2/3) ... [2018-10-26 22:33:09,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d046e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:33:09, skipping insertion in model container [2018-10-26 22:33:09,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:33:09" (3/3) ... [2018-10-26 22:33:09,229 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-26 22:33:09,241 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:33:09,255 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:33:09,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:33:09,310 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:33:09,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:33:09,311 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:33:09,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:33:09,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:33:09,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:33:09,312 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:33:09,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:33:09,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:33:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-26 22:33:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 22:33:09,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:09,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:09,334 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:09,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:09,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1505404269, now seen corresponding path program 1 times [2018-10-26 22:33:09,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:09,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:09,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:09,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:33:09,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:33:09,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:33:09,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:33:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:33:09,503 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-10-26 22:33:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:09,522 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-10-26 22:33:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:33:09,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-10-26 22:33:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:09,545 INFO L225 Difference]: With dead ends: 30 [2018-10-26 22:33:09,546 INFO L226 Difference]: Without dead ends: 14 [2018-10-26 22:33:09,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:33:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-26 22:33:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-26 22:33:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-26 22:33:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-26 22:33:09,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2018-10-26 22:33:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:09,592 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-26 22:33:09,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:33:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-26 22:33:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 22:33:09,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:09,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:09,597 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:09,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:09,597 INFO L82 PathProgramCache]: Analyzing trace with hash -207585610, now seen corresponding path program 1 times [2018-10-26 22:33:09,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:09,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:09,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:09,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:33:09,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:33:09,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:33:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:33:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:33:09,941 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-10-26 22:33:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:10,084 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-10-26 22:33:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:33:10,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-10-26 22:33:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:10,086 INFO L225 Difference]: With dead ends: 27 [2018-10-26 22:33:10,086 INFO L226 Difference]: Without dead ends: 17 [2018-10-26 22:33:10,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:33:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-26 22:33:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-10-26 22:33:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-26 22:33:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-10-26 22:33:10,092 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 10 [2018-10-26 22:33:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:10,092 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-10-26 22:33:10,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:33:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-10-26 22:33:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 22:33:10,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:10,094 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:10,094 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1943052177, now seen corresponding path program 1 times [2018-10-26 22:33:10,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:10,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:10,401 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-10-26 22:33:10,615 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-10-26 22:33:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:10,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:10,627 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:10,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:10,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:10,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:33:10,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:33:10,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:10,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:10,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:10,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-26 22:33:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:10,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:10,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-26 22:33:10,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:33:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:33:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:33:10,837 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-10-26 22:33:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:11,165 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-10-26 22:33:11,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:33:11,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-26 22:33:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:11,166 INFO L225 Difference]: With dead ends: 26 [2018-10-26 22:33:11,167 INFO L226 Difference]: Without dead ends: 24 [2018-10-26 22:33:11,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:33:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-26 22:33:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-10-26 22:33:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-26 22:33:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-26 22:33:11,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-10-26 22:33:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:11,174 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-26 22:33:11,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:33:11,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-26 22:33:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 22:33:11,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:11,175 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:11,175 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:11,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:11,175 INFO L82 PathProgramCache]: Analyzing trace with hash -849476735, now seen corresponding path program 1 times [2018-10-26 22:33:11,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:11,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:11,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:11,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:11,289 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:11,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:11,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:11,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-26 22:33:11,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 22:33:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 22:33:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:33:11,620 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-10-26 22:33:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:11,942 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-10-26 22:33:11,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:33:11,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-26 22:33:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:11,944 INFO L225 Difference]: With dead ends: 38 [2018-10-26 22:33:11,944 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 22:33:11,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:33:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 22:33:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-10-26 22:33:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-26 22:33:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-10-26 22:33:11,950 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-10-26 22:33:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:11,950 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-10-26 22:33:11,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 22:33:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-10-26 22:33:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 22:33:11,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:11,951 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:11,952 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:11,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2114381476, now seen corresponding path program 2 times [2018-10-26 22:33:11,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:11,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:11,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:11,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:12,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:12,327 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:12,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:33:12,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:33:12,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:12,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:12,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:33:12,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:33:12,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:12,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:12,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:12,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:33:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:12,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:12,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-10-26 22:33:12,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:33:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:33:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:33:12,722 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 17 states. [2018-10-26 22:33:13,258 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-10-26 22:33:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:13,950 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-10-26 22:33:13,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:33:13,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-10-26 22:33:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:13,952 INFO L225 Difference]: With dead ends: 62 [2018-10-26 22:33:13,952 INFO L226 Difference]: Without dead ends: 60 [2018-10-26 22:33:13,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:33:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-26 22:33:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2018-10-26 22:33:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 22:33:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-10-26 22:33:13,966 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2018-10-26 22:33:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:13,966 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-10-26 22:33:13,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:33:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-10-26 22:33:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 22:33:13,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:13,968 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:13,968 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:13,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:13,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1975387279, now seen corresponding path program 3 times [2018-10-26 22:33:13,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:13,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:14,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:14,435 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:14,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:33:14,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 22:33:14,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:14,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:14,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:14,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:14,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:14,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:14,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:14,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:33:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:15,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:15,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-10-26 22:33:15,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 22:33:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 22:33:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:33:15,025 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 21 states. [2018-10-26 22:33:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:16,180 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-10-26 22:33:16,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 22:33:16,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-26 22:33:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:16,182 INFO L225 Difference]: With dead ends: 73 [2018-10-26 22:33:16,182 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 22:33:16,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 22:33:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 22:33:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-26 22:33:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 22:33:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-26 22:33:16,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2018-10-26 22:33:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:16,191 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-26 22:33:16,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 22:33:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-26 22:33:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 22:33:16,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:16,193 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:16,193 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:16,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1638908234, now seen corresponding path program 4 times [2018-10-26 22:33:16,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:16,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:16,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:16,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:16,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:16,499 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:16,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:33:16,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:33:16,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:16,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:16,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:16,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:16,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:16,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:16,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:16,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:33:16,729 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 23 treesize of output 18 [2018-10-26 22:33:16,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:33:16,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:33:16,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:16,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:16,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:16,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:33:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:16,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:16,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-10-26 22:33:16,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:33:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:33:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:33:16,868 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-10-26 22:33:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:17,481 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-10-26 22:33:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 22:33:17,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-26 22:33:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:17,482 INFO L225 Difference]: With dead ends: 44 [2018-10-26 22:33:17,482 INFO L226 Difference]: Without dead ends: 42 [2018-10-26 22:33:17,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:33:17,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-26 22:33:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-10-26 22:33:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-26 22:33:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-26 22:33:17,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2018-10-26 22:33:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:17,493 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-26 22:33:17,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:33:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-26 22:33:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 22:33:17,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:17,494 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:17,494 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:17,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash -336784516, now seen corresponding path program 5 times [2018-10-26 22:33:17,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:17,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:17,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:18,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:18,067 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:33:18,083 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:18,120 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-26 22:33:18,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:18,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:18,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:33:18,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:33:18,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:18,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:18,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:18,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:33:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:18,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-10-26 22:33:18,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 22:33:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 22:33:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:33:18,507 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 25 states. [2018-10-26 22:33:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:20,114 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-10-26 22:33:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-26 22:33:20,115 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-10-26 22:33:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:20,116 INFO L225 Difference]: With dead ends: 79 [2018-10-26 22:33:20,117 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 22:33:20,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=294, Invalid=1686, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 22:33:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 22:33:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-10-26 22:33:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 22:33:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-26 22:33:20,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-10-26 22:33:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:20,128 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-26 22:33:20,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 22:33:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-26 22:33:20,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:33:20,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:20,130 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:20,130 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:20,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash 877805393, now seen corresponding path program 6 times [2018-10-26 22:33:20,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:20,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:20,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:20,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:20,446 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:20,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:33:20,516 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-26 22:33:20,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:20,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:20,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:20,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:20,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:20,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:20,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:20,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:33:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:20,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-10-26 22:33:20,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:33:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:33:21,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:33:21,000 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 27 states. [2018-10-26 22:33:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:21,960 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-10-26 22:33:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 22:33:21,960 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-10-26 22:33:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:21,961 INFO L225 Difference]: With dead ends: 80 [2018-10-26 22:33:21,961 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 22:33:21,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:33:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 22:33:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-26 22:33:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 22:33:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-26 22:33:21,971 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2018-10-26 22:33:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:21,971 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-26 22:33:21,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:33:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-26 22:33:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 22:33:21,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:21,973 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:21,973 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:21,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:21,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1622976362, now seen corresponding path program 7 times [2018-10-26 22:33:21,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:21,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:21,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:22,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:22,865 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:22,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:22,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:22,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:22,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:22,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:22,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:22,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:22,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:33:22,991 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 23 treesize of output 18 [2018-10-26 22:33:22,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:33:22,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:33:22,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:23,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:23,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:23,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:33:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:23,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:23,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-10-26 22:33:23,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:33:23,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:33:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:33:23,286 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 23 states. [2018-10-26 22:33:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:24,216 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-10-26 22:33:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:33:24,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-10-26 22:33:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:24,218 INFO L225 Difference]: With dead ends: 60 [2018-10-26 22:33:24,218 INFO L226 Difference]: Without dead ends: 58 [2018-10-26 22:33:24,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 22:33:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-26 22:33:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-10-26 22:33:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-26 22:33:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-26 22:33:24,230 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2018-10-26 22:33:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:24,230 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-26 22:33:24,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:33:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-26 22:33:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 22:33:24,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:24,231 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:24,232 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:24,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1304484452, now seen corresponding path program 8 times [2018-10-26 22:33:24,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:24,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:24,794 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:24,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:33:24,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:33:24,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:24,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:24,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:33:24,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:33:24,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:24,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:24,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:24,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 22:33:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:25,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-10-26 22:33:25,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 22:33:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 22:33:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:33:25,250 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 33 states. [2018-10-26 22:33:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:27,381 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-10-26 22:33:27,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-26 22:33:27,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-10-26 22:33:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:27,382 INFO L225 Difference]: With dead ends: 105 [2018-10-26 22:33:27,382 INFO L226 Difference]: Without dead ends: 67 [2018-10-26 22:33:27,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2018-10-26 22:33:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-26 22:33:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-10-26 22:33:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 22:33:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-10-26 22:33:27,396 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 53 [2018-10-26 22:33:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:27,396 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-10-26 22:33:27,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 22:33:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-10-26 22:33:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-26 22:33:27,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:27,397 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:27,398 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:27,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1308584753, now seen corresponding path program 9 times [2018-10-26 22:33:27,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:27,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:27,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 50 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:27,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:27,944 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:27,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:33:28,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-26 22:33:28,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:28,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:28,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:28,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:28,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:28,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:28,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:28,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:33:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 87 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:28,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:28,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-26 22:33:28,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 22:33:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 22:33:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:33:28,590 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 33 states. [2018-10-26 22:33:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:30,587 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-10-26 22:33:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-26 22:33:30,588 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2018-10-26 22:33:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:30,589 INFO L225 Difference]: With dead ends: 106 [2018-10-26 22:33:30,589 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 22:33:30,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=700, Invalid=2960, Unknown=0, NotChecked=0, Total=3660 [2018-10-26 22:33:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 22:33:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-26 22:33:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-26 22:33:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-10-26 22:33:30,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2018-10-26 22:33:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:30,608 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-10-26 22:33:30,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 22:33:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-10-26 22:33:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 22:33:30,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:30,609 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:30,609 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:30,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:30,609 INFO L82 PathProgramCache]: Analyzing trace with hash 191322742, now seen corresponding path program 10 times [2018-10-26 22:33:30,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:30,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:30,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:30,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:31,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:31,226 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:31,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:33:31,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:33:31,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:31,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:31,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:31,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:31,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:31,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:31,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:31,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:33:31,443 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 23 treesize of output 18 [2018-10-26 22:33:31,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:33:31,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:33:31,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:31,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:31,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:31,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:33:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:31,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 29 [2018-10-26 22:33:31,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:33:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:33:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:33:31,790 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 29 states. [2018-10-26 22:33:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:32,842 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-10-26 22:33:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 22:33:32,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-10-26 22:33:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:32,844 INFO L225 Difference]: With dead ends: 76 [2018-10-26 22:33:32,844 INFO L226 Difference]: Without dead ends: 74 [2018-10-26 22:33:32,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:33:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-26 22:33:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-10-26 22:33:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-26 22:33:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-26 22:33:32,858 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2018-10-26 22:33:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:32,858 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-26 22:33:32,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:33:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-26 22:33:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 22:33:32,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:32,860 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:32,860 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:32,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1873891260, now seen corresponding path program 11 times [2018-10-26 22:33:32,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:32,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:32,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:32,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 75 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:34,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:34,056 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:34,065 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:33:34,142 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-26 22:33:34,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:34,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:34,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:33:34,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:33:34,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:34,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:34,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:34,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:33:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:35,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:35,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2018-10-26 22:33:35,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-26 22:33:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-26 22:33:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1437, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 22:33:35,079 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 41 states. [2018-10-26 22:33:38,360 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-10-26 22:33:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:38,456 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-10-26 22:33:38,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-26 22:33:38,457 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 69 [2018-10-26 22:33:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:38,457 INFO L225 Difference]: With dead ends: 131 [2018-10-26 22:33:38,457 INFO L226 Difference]: Without dead ends: 83 [2018-10-26 22:33:38,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=576, Invalid=4680, Unknown=0, NotChecked=0, Total=5256 [2018-10-26 22:33:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-26 22:33:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-10-26 22:33:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-26 22:33:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-26 22:33:38,473 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 69 [2018-10-26 22:33:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:38,473 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-26 22:33:38,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-26 22:33:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-26 22:33:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 22:33:38,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:38,475 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:38,475 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1304919825, now seen corresponding path program 12 times [2018-10-26 22:33:38,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:38,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 105 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:39,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:39,093 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:33:39,207 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-26 22:33:39,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:39,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:39,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:39,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:39,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:39,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:39,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:39,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:33:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 156 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:41,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:41,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2018-10-26 22:33:41,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-26 22:33:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-26 22:33:41,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2018-10-26 22:33:41,234 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 40 states. [2018-10-26 22:33:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:42,864 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2018-10-26 22:33:42,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-26 22:33:42,864 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-10-26 22:33:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:42,865 INFO L225 Difference]: With dead ends: 130 [2018-10-26 22:33:42,865 INFO L226 Difference]: Without dead ends: 82 [2018-10-26 22:33:42,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=970, Invalid=4730, Unknown=0, NotChecked=0, Total=5700 [2018-10-26 22:33:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-26 22:33:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-26 22:33:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-26 22:33:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-10-26 22:33:42,881 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2018-10-26 22:33:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:42,881 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-10-26 22:33:42,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-26 22:33:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-10-26 22:33:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 22:33:42,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:42,882 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:42,883 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1321581482, now seen corresponding path program 13 times [2018-10-26 22:33:42,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:42,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:42,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:43,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:43,414 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:43,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:43,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:43,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:43,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:43,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:43,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:43,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:33:43,570 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 23 treesize of output 18 [2018-10-26 22:33:43,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:33:43,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:33:43,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:43,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:43,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:43,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:33:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:44,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:44,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 35 [2018-10-26 22:33:44,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-26 22:33:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-26 22:33:44,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 22:33:44,231 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 35 states. [2018-10-26 22:33:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:45,811 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-10-26 22:33:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 22:33:45,811 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2018-10-26 22:33:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:45,812 INFO L225 Difference]: With dead ends: 92 [2018-10-26 22:33:45,812 INFO L226 Difference]: Without dead ends: 90 [2018-10-26 22:33:45,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=2905, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 22:33:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-26 22:33:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-10-26 22:33:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-26 22:33:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-10-26 22:33:45,824 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2018-10-26 22:33:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:45,825 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-10-26 22:33:45,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-26 22:33:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-10-26 22:33:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 22:33:45,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:45,826 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:45,826 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:45,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1266314788, now seen corresponding path program 14 times [2018-10-26 22:33:45,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:45,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:45,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:45,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:33:45,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 140 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:46,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:46,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:46,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:33:46,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:33:46,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:46,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:47,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:47,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:47,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:47,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:47,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:47,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:33:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 190 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:47,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:47,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 43 [2018-10-26 22:33:47,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 22:33:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 22:33:47,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:33:47,718 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2018-10-26 22:33:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:50,335 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-10-26 22:33:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-26 22:33:50,336 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2018-10-26 22:33:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:50,337 INFO L225 Difference]: With dead ends: 143 [2018-10-26 22:33:50,338 INFO L226 Difference]: Without dead ends: 90 [2018-10-26 22:33:50,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1208, Invalid=5434, Unknown=0, NotChecked=0, Total=6642 [2018-10-26 22:33:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-26 22:33:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-26 22:33:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-26 22:33:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-10-26 22:33:50,351 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2018-10-26 22:33:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:50,351 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-10-26 22:33:50,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 22:33:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-10-26 22:33:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 22:33:50,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:50,353 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:50,353 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:50,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash 634733089, now seen corresponding path program 15 times [2018-10-26 22:33:50,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:50,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:50,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:50,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:50,963 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:50,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:33:51,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-26 22:33:51,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:51,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:51,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:33:51,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:33:51,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:51,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:51,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:51,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:33:51,276 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 23 treesize of output 18 [2018-10-26 22:33:51,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:33:51,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:33:51,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:51,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:51,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:51,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:33:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:51,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 38 [2018-10-26 22:33:51,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-26 22:33:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-26 22:33:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 22:33:51,666 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 38 states. [2018-10-26 22:33:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:53,172 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-10-26 22:33:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-26 22:33:53,172 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2018-10-26 22:33:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:53,173 INFO L225 Difference]: With dead ends: 100 [2018-10-26 22:33:53,173 INFO L226 Difference]: Without dead ends: 98 [2018-10-26 22:33:53,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=312, Invalid=3470, Unknown=0, NotChecked=0, Total=3782 [2018-10-26 22:33:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-26 22:33:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-10-26 22:33:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-26 22:33:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-10-26 22:33:53,189 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 88 [2018-10-26 22:33:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:53,189 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-10-26 22:33:53,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-26 22:33:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-10-26 22:33:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 22:33:53,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:53,190 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:53,190 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:53,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 615021297, now seen corresponding path program 16 times [2018-10-26 22:33:53,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:53,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:53,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 180 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:53,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:53,923 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:33:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:33:54,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:33:54,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:54,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:54,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:33:54,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:33:54,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:54,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:54,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:54,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 22:33:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:54,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:33:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2018-10-26 22:33:54,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-26 22:33:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-26 22:33:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2018-10-26 22:33:54,741 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 52 states. [2018-10-26 22:33:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:33:58,424 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-26 22:33:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-26 22:33:58,430 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 93 [2018-10-26 22:33:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:33:58,431 INFO L225 Difference]: With dead ends: 170 [2018-10-26 22:33:58,431 INFO L226 Difference]: Without dead ends: 107 [2018-10-26 22:33:58,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2522 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=825, Invalid=7731, Unknown=0, NotChecked=0, Total=8556 [2018-10-26 22:33:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-26 22:33:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-10-26 22:33:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-26 22:33:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-10-26 22:33:58,447 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 93 [2018-10-26 22:33:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:33:58,447 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-10-26 22:33:58,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-26 22:33:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-10-26 22:33:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 22:33:58,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:33:58,448 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:33:58,448 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:33:58,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:33:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash 645786620, now seen corresponding path program 17 times [2018-10-26 22:33:58,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:33:58,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:33:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:58,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:33:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:33:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:33:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 225 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:33:59,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:33:59,266 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:33:59,275 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:33:59,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-26 22:33:59,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:33:59,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:33:59,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:33:59,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:33:59,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:33:59,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:59,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:33:59,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:34:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:00,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:00,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 57 [2018-10-26 22:34:00,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-26 22:34:00,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-26 22:34:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2827, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 22:34:00,683 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 57 states. [2018-10-26 22:34:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:04,861 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-10-26 22:34:04,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-26 22:34:04,862 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 101 [2018-10-26 22:34:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:04,863 INFO L225 Difference]: With dead ends: 183 [2018-10-26 22:34:04,863 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 22:34:04,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=938, Invalid=9162, Unknown=0, NotChecked=0, Total=10100 [2018-10-26 22:34:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 22:34:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-10-26 22:34:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-26 22:34:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-10-26 22:34:04,881 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 101 [2018-10-26 22:34:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:04,881 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-10-26 22:34:04,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-26 22:34:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-10-26 22:34:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 22:34:04,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:04,882 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:04,882 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:04,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash 505437905, now seen corresponding path program 18 times [2018-10-26 22:34:04,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:04,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:04,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:34:04,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 275 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:07,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:07,308 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:07,316 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:34:07,665 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-10-26 22:34:07,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:34:07,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:07,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:34:07,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:34:07,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:07,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:07,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:07,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:34:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 354 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:08,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:08,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 51 [2018-10-26 22:34:08,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-26 22:34:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-26 22:34:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=2084, Unknown=0, NotChecked=0, Total=2550 [2018-10-26 22:34:08,748 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 51 states. [2018-10-26 22:34:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:11,159 INFO L93 Difference]: Finished difference Result 184 states and 186 transitions. [2018-10-26 22:34:11,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-26 22:34:11,160 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 109 [2018-10-26 22:34:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:11,162 INFO L225 Difference]: With dead ends: 184 [2018-10-26 22:34:11,163 INFO L226 Difference]: Without dead ends: 114 [2018-10-26 22:34:11,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3128 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1766, Invalid=8740, Unknown=0, NotChecked=0, Total=10506 [2018-10-26 22:34:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-26 22:34:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-26 22:34:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-26 22:34:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-10-26 22:34:11,182 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2018-10-26 22:34:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:11,182 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-10-26 22:34:11,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-26 22:34:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-10-26 22:34:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-26 22:34:11,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:11,183 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:11,183 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:11,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 677695510, now seen corresponding path program 19 times [2018-10-26 22:34:11,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:11,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:11,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:11,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:34:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:12,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:12,231 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:12,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:34:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:12,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:12,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:34:12,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:34:12,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:12,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:12,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:12,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:34:12,469 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 23 treesize of output 18 [2018-10-26 22:34:12,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:34:12,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:34:12,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:12,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:12,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:12,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:34:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:13,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:13,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 47 [2018-10-26 22:34:13,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-26 22:34:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-26 22:34:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2037, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:34:13,137 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 47 states. [2018-10-26 22:34:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:15,274 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2018-10-26 22:34:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-26 22:34:15,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 112 [2018-10-26 22:34:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:15,277 INFO L225 Difference]: With dead ends: 124 [2018-10-26 22:34:15,277 INFO L226 Difference]: Without dead ends: 122 [2018-10-26 22:34:15,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=387, Invalid=5465, Unknown=0, NotChecked=0, Total=5852 [2018-10-26 22:34:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-26 22:34:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-10-26 22:34:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-26 22:34:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-10-26 22:34:15,299 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 112 [2018-10-26 22:34:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:15,299 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-10-26 22:34:15,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-26 22:34:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-10-26 22:34:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 22:34:15,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:15,300 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:15,300 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:15,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1596170724, now seen corresponding path program 20 times [2018-10-26 22:34:15,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:15,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:15,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:34:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 330 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:16,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:16,493 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:16,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:34:16,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:34:16,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:34:16,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:16,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:34:16,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:34:16,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:16,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:16,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:16,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:34:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 404 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:17,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 55 [2018-10-26 22:34:17,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-26 22:34:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-26 22:34:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-26 22:34:17,798 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 55 states. [2018-10-26 22:34:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:20,555 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-10-26 22:34:20,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-26 22:34:20,555 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2018-10-26 22:34:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:20,556 INFO L225 Difference]: With dead ends: 195 [2018-10-26 22:34:20,557 INFO L226 Difference]: Without dead ends: 122 [2018-10-26 22:34:20,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3519 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2124, Invalid=9866, Unknown=0, NotChecked=0, Total=11990 [2018-10-26 22:34:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-26 22:34:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-26 22:34:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-26 22:34:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-26 22:34:20,580 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2018-10-26 22:34:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:20,581 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-26 22:34:20,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-26 22:34:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-26 22:34:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 22:34:20,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:20,582 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:20,582 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:20,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1385282145, now seen corresponding path program 21 times [2018-10-26 22:34:20,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:20,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:20,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:34:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:21,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:21,515 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:21,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:34:21,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-26 22:34:21,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:34:21,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:22,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:34:22,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:34:22,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:22,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:22,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:22,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:34:22,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:34:22,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:34:22,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:34:22,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:22,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:22,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:22,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:13 [2018-10-26 22:34:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:23,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:23,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 67 [2018-10-26 22:34:23,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-26 22:34:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-26 22:34:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4218, Unknown=0, NotChecked=0, Total=4422 [2018-10-26 22:34:23,846 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 67 states. [2018-10-26 22:34:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:26,910 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-10-26 22:34:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-26 22:34:26,910 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 120 [2018-10-26 22:34:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:26,912 INFO L225 Difference]: With dead ends: 132 [2018-10-26 22:34:26,912 INFO L226 Difference]: Without dead ends: 130 [2018-10-26 22:34:26,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=550, Invalid=9152, Unknown=0, NotChecked=0, Total=9702 [2018-10-26 22:34:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-26 22:34:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-10-26 22:34:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-26 22:34:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-10-26 22:34:26,942 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 120 [2018-10-26 22:34:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:26,942 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-10-26 22:34:26,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-26 22:34:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-10-26 22:34:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 22:34:26,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:26,943 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:26,943 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:26,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1070781775, now seen corresponding path program 22 times [2018-10-26 22:34:26,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:26,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:26,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:26,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:34:26,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 390 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:28,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:28,039 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:28,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:34:28,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:34:28,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:34:28,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:29,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:34:29,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:34:29,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:29,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:29,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:29,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 22:34:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 842 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:29,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:29,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 68 [2018-10-26 22:34:29,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-26 22:34:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-26 22:34:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=4057, Unknown=0, NotChecked=0, Total=4556 [2018-10-26 22:34:29,783 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 68 states. [2018-10-26 22:34:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:34,645 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-10-26 22:34:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-26 22:34:34,645 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 125 [2018-10-26 22:34:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:34,646 INFO L225 Difference]: With dead ends: 222 [2018-10-26 22:34:34,646 INFO L226 Difference]: Without dead ends: 139 [2018-10-26 22:34:34,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1185, Invalid=13335, Unknown=0, NotChecked=0, Total=14520 [2018-10-26 22:34:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-26 22:34:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2018-10-26 22:34:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-26 22:34:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-10-26 22:34:34,672 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 125 [2018-10-26 22:34:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:34,672 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-10-26 22:34:34,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-26 22:34:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-10-26 22:34:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 22:34:34,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:34,673 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:34,673 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:34,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1415768124, now seen corresponding path program 23 times [2018-10-26 22:34:34,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:34,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:34,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:34:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 455 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:35,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:35,819 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:35,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:34:36,208 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-26 22:34:36,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:34:36,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:36,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:34:36,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:34:36,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:36,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:36,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:36,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:34:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:37,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:37,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 73 [2018-10-26 22:34:37,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-26 22:34:37,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-26 22:34:37,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=4681, Unknown=0, NotChecked=0, Total=5256 [2018-10-26 22:34:37,638 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 73 states. [2018-10-26 22:34:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:34:43,313 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2018-10-26 22:34:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-26 22:34:43,313 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 133 [2018-10-26 22:34:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:34:43,314 INFO L225 Difference]: With dead ends: 235 [2018-10-26 22:34:43,314 INFO L226 Difference]: Without dead ends: 147 [2018-10-26 22:34:43,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5115 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1380, Invalid=15132, Unknown=0, NotChecked=0, Total=16512 [2018-10-26 22:34:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-26 22:34:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2018-10-26 22:34:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-26 22:34:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-10-26 22:34:43,350 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 133 [2018-10-26 22:34:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:34:43,351 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-10-26 22:34:43,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-26 22:34:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-10-26 22:34:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-26 22:34:43,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:34:43,352 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:34:43,352 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:34:43,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:34:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1421025647, now seen corresponding path program 24 times [2018-10-26 22:34:43,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:34:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:34:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:43,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:34:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:34:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:34:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 525 proven. 565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:45,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:34:45,009 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:34:45,021 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:34:45,537 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-10-26 22:34:45,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:34:45,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:34:45,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:34:45,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:34:45,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:45,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:45,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:45,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:34:45,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-26 22:34:45,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-10-26 22:34:45,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:34:45,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:34:45,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:34:45,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-26 22:34:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 632 proven. 458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:34:47,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:34:47,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 66 [2018-10-26 22:34:47,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-26 22:34:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-26 22:34:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=3485, Unknown=0, NotChecked=0, Total=4290 [2018-10-26 22:34:47,859 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 66 states. [2018-10-26 22:34:51,147 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-10-26 22:34:51,561 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-10-26 22:34:53,011 WARN L179 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-10-26 22:34:54,320 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-10-26 22:34:55,558 WARN L179 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-26 22:34:55,886 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-26 22:34:57,041 WARN L179 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-26 22:34:57,444 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-26 22:34:57,709 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-10-26 22:34:59,290 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-26 22:34:59,803 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-10-26 22:35:00,022 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2018-10-26 22:35:01,250 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-10-26 22:35:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:35:02,092 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2018-10-26 22:35:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-26 22:35:02,093 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 141 [2018-10-26 22:35:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:35:02,094 INFO L225 Difference]: With dead ends: 234 [2018-10-26 22:35:02,094 INFO L226 Difference]: Without dead ends: 146 [2018-10-26 22:35:02,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5088 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=2983, Invalid=14047, Unknown=0, NotChecked=0, Total=17030 [2018-10-26 22:35:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-26 22:35:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-26 22:35:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-26 22:35:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-26 22:35:02,125 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2018-10-26 22:35:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:35:02,125 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-26 22:35:02,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-26 22:35:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-26 22:35:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 22:35:02,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:02,127 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:02,127 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:02,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash -894239786, now seen corresponding path program 25 times [2018-10-26 22:35:02,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:35:02,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:35:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:02,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:35:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:03,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:35:03,220 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:35:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:35:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:03,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:03,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:35:03,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:03,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:03,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:03,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:03,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:35:03,447 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 23 treesize of output 18 [2018-10-26 22:35:03,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:35:03,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:35:03,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:03,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:03,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:03,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:35:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:04,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:35:04,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 59 [2018-10-26 22:35:04,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-26 22:35:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-26 22:35:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3265, Unknown=0, NotChecked=0, Total=3422 [2018-10-26 22:35:04,401 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 59 states. [2018-10-26 22:35:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:35:08,346 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-26 22:35:08,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-26 22:35:08,346 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 144 [2018-10-26 22:35:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:35:08,347 INFO L225 Difference]: With dead ends: 156 [2018-10-26 22:35:08,347 INFO L226 Difference]: Without dead ends: 154 [2018-10-26 22:35:08,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=487, Invalid=8825, Unknown=0, NotChecked=0, Total=9312 [2018-10-26 22:35:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-26 22:35:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-10-26 22:35:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-26 22:35:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-10-26 22:35:08,375 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 144 [2018-10-26 22:35:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:35:08,376 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-10-26 22:35:08,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-26 22:35:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-10-26 22:35:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-26 22:35:08,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:08,377 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:08,377 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:08,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash -413955492, now seen corresponding path program 26 times [2018-10-26 22:35:08,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:35:08,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:35:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:08,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:35:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 600 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:09,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:35:09,914 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:35:09,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:35:10,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:35:10,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:35:10,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:10,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:35:10,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:35:10,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:10,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:10,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:10,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 22:35:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 0 proven. 1226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:11,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:35:11,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 81 [2018-10-26 22:35:11,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-26 22:35:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-26 22:35:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=5800, Unknown=0, NotChecked=0, Total=6480 [2018-10-26 22:35:11,716 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 81 states. [2018-10-26 22:35:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:35:18,343 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2018-10-26 22:35:18,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-26 22:35:18,343 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 149 [2018-10-26 22:35:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:35:18,344 INFO L225 Difference]: With dead ends: 261 [2018-10-26 22:35:18,344 INFO L226 Difference]: Without dead ends: 163 [2018-10-26 22:35:18,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6549 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1576, Invalid=19304, Unknown=0, NotChecked=0, Total=20880 [2018-10-26 22:35:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-26 22:35:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-10-26 22:35:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-26 22:35:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-10-26 22:35:18,375 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 149 [2018-10-26 22:35:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:35:18,394 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-10-26 22:35:18,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-26 22:35:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-10-26 22:35:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-26 22:35:18,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:18,395 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:18,395 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:18,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2055043697, now seen corresponding path program 27 times [2018-10-26 22:35:18,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:35:18,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:35:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:18,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:35:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 680 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:20,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:35:20,455 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:35:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:35:21,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-10-26 22:35:21,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:35:21,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:22,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:35:22,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:22,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:22,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:22,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:22,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 22:35:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 801 proven. 569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:24,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:35:24,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44] total 69 [2018-10-26 22:35:24,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-26 22:35:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-26 22:35:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=892, Invalid=3800, Unknown=0, NotChecked=0, Total=4692 [2018-10-26 22:35:24,520 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 69 states. [2018-10-26 22:35:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:35:28,476 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-10-26 22:35:28,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-26 22:35:28,476 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 157 [2018-10-26 22:35:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:35:28,478 INFO L225 Difference]: With dead ends: 262 [2018-10-26 22:35:28,478 INFO L226 Difference]: Without dead ends: 162 [2018-10-26 22:35:28,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6386 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3470, Invalid=17410, Unknown=0, NotChecked=0, Total=20880 [2018-10-26 22:35:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-26 22:35:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-26 22:35:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-26 22:35:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-10-26 22:35:28,516 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 157 [2018-10-26 22:35:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:35:28,516 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-10-26 22:35:28,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-26 22:35:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-10-26 22:35:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-26 22:35:28,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:28,517 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:28,518 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:28,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash 164785590, now seen corresponding path program 28 times [2018-10-26 22:35:28,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:35:28,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:35:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:28,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:35:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 0 proven. 1429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:30,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:35:30,498 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:35:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:35:31,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:35:31,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:35:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:31,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:35:31,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:31,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:31,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:31,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:31,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:35:31,341 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 23 treesize of output 18 [2018-10-26 22:35:31,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:35:31,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:35:31,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:31,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:31,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:31,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:35:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 0 proven. 1429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:32,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:35:32,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 65 [2018-10-26 22:35:32,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-26 22:35:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-26 22:35:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3987, Unknown=0, NotChecked=0, Total=4160 [2018-10-26 22:35:32,738 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 65 states. [2018-10-26 22:35:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:35:37,302 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2018-10-26 22:35:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-26 22:35:37,303 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 160 [2018-10-26 22:35:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:35:37,304 INFO L225 Difference]: With dead ends: 172 [2018-10-26 22:35:37,304 INFO L226 Difference]: Without dead ends: 170 [2018-10-26 22:35:37,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2021 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=537, Invalid=10805, Unknown=0, NotChecked=0, Total=11342 [2018-10-26 22:35:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-26 22:35:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2018-10-26 22:35:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-26 22:35:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-10-26 22:35:37,338 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 160 [2018-10-26 22:35:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:35:37,338 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-10-26 22:35:37,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-26 22:35:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-10-26 22:35:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-26 22:35:37,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:37,339 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:37,339 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:37,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1787804548, now seen corresponding path program 29 times [2018-10-26 22:35:37,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:35:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:35:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:37,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:35:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:38,416 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-26 22:35:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 765 proven. 757 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:39,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:35:39,453 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:35:39,461 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:35:39,990 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-10-26 22:35:39,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:35:39,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:40,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:35:40,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:35:40,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:40,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:40,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:40,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:35:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 0 proven. 1522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:35:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 44] total 89 [2018-10-26 22:35:41,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-26 22:35:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-26 22:35:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=6999, Unknown=0, NotChecked=0, Total=7832 [2018-10-26 22:35:41,839 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 89 states. [2018-10-26 22:35:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:35:48,182 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2018-10-26 22:35:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-26 22:35:48,182 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 165 [2018-10-26 22:35:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:35:48,183 INFO L225 Difference]: With dead ends: 287 [2018-10-26 22:35:48,183 INFO L226 Difference]: Without dead ends: 179 [2018-10-26 22:35:48,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1824, Invalid=22668, Unknown=0, NotChecked=0, Total=24492 [2018-10-26 22:35:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-26 22:35:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2018-10-26 22:35:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-26 22:35:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-10-26 22:35:48,229 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 165 [2018-10-26 22:35:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:35:48,229 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-10-26 22:35:48,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-26 22:35:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-10-26 22:35:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 22:35:48,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:35:48,230 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:35:48,230 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:35:48,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:35:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1556283823, now seen corresponding path program 30 times [2018-10-26 22:35:48,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:35:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:35:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:48,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:35:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:35:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:35:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 855 proven. 827 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:35:49,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:35:49,853 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:35:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 22:35:52,487 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-26 22:35:52,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:35:52,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:35:52,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:35:52,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:52,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:52,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:52,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:52,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:35:53,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:35:53,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-10-26 22:35:53,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:35:53,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-26 22:35:53,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:35:53,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:35:53,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:29 [2018-10-26 22:35:53,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-26 22:35:53,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-10-26 22:35:53,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,382 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 22 treesize of output 19 [2018-10-26 22:35:53,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:53,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:35:53,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-10-26 22:35:53,516 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 34 treesize of output 29 [2018-10-26 22:35:53,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:35:53,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,583 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 25 treesize of output 22 [2018-10-26 22:35:53,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:35:53,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:35:53,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:33 [2018-10-26 22:35:53,724 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 34 treesize of output 29 [2018-10-26 22:35:53,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:35:53,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:53,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-10-26 22:35:53,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:35:53,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:53,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:35:53,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:60, output treesize:33 [2018-10-26 22:35:53,988 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 22 treesize of output 19 [2018-10-26 22:35:54,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:54,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:54,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:54,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-26 22:35:54,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-10-26 22:35:54,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 22:35:54,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:54,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:35:54,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-10-26 22:35:54,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-26 22:35:54,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-10-26 22:35:54,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:54,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:54,230 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 22 treesize of output 19 [2018-10-26 22:35:54,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:35:54,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:35:54,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:35:54,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:35:54,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-10-26 22:35:55,048 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 22:35:57,178 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 22:35:58,965 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 41 [2018-10-26 22:35:59,770 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-10-26 22:36:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 87 proven. 1595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:36:01,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:36:01,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 52] total 99 [2018-10-26 22:36:01,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-26 22:36:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-26 22:36:01,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1374, Invalid=8328, Unknown=0, NotChecked=0, Total=9702 [2018-10-26 22:36:01,004 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 99 states. [2018-10-26 22:36:01,508 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2018-10-26 22:36:04,539 WARN L179 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-26 22:36:05,739 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-10-26 22:36:06,190 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-26 22:36:07,221 WARN L179 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-10-26 22:36:07,569 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-10-26 22:36:09,168 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-26 22:36:10,595 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:10,833 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:11,288 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-26 22:36:11,601 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-26 22:36:11,976 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:13,141 WARN L179 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-10-26 22:36:13,382 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-26 22:36:16,574 WARN L179 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:16,818 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-26 22:36:17,331 WARN L179 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-10-26 22:36:17,570 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-26 22:36:17,867 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-26 22:36:18,110 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:20,411 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-26 22:36:20,657 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:21,317 WARN L179 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-10-26 22:36:21,573 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-26 22:36:21,875 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-10-26 22:36:22,357 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-10-26 22:36:22,650 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-26 22:36:23,222 WARN L179 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:23,794 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-26 22:36:24,258 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:24,829 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-26 22:36:25,089 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-26 22:36:25,398 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-10-26 22:36:25,639 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-10-26 22:36:41,071 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2018-10-26 22:36:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:36:48,590 INFO L93 Difference]: Finished difference Result 288 states and 290 transitions. [2018-10-26 22:36:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-26 22:36:48,590 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 173 [2018-10-26 22:36:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:36:48,592 INFO L225 Difference]: With dead ends: 288 [2018-10-26 22:36:48,593 INFO L226 Difference]: Without dead ends: 178 [2018-10-26 22:36:48,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12056 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=3571, Invalid=29725, Unknown=10, NotChecked=0, Total=33306 [2018-10-26 22:36:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-26 22:36:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-26 22:36:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-26 22:36:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-10-26 22:36:48,644 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 173 [2018-10-26 22:36:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:36:48,644 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-10-26 22:36:48,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-26 22:36:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-10-26 22:36:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 22:36:48,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:36:48,645 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:36:48,646 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:36:48,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:36:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 102025110, now seen corresponding path program 31 times [2018-10-26 22:36:48,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:36:48,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:36:48,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:36:48,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:36:48,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:36:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:36:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1747 backedges. 0 proven. 1747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:36:50,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:36:50,299 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:36:50,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:36:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:36:50,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:36:50,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:36:50,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:36:50,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:36:50,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:36:50,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:36:50,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:36:50,546 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 23 treesize of output 18 [2018-10-26 22:36:50,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:36:50,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 22:36:50,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:36:50,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:36:50,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:36:50,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-10-26 22:36:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1747 backedges. 0 proven. 1747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:36:51,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:36:51,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 71 [2018-10-26 22:36:51,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-26 22:36:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-26 22:36:51,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4781, Unknown=0, NotChecked=0, Total=4970 [2018-10-26 22:36:51,940 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 71 states. [2018-10-26 22:36:57,063 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 22:36:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:36:57,871 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-26 22:36:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-26 22:36:57,871 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 176 [2018-10-26 22:36:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:36:57,872 INFO L225 Difference]: With dead ends: 188 [2018-10-26 22:36:57,872 INFO L226 Difference]: Without dead ends: 186 [2018-10-26 22:36:57,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 152 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=587, Invalid=12985, Unknown=0, NotChecked=0, Total=13572 [2018-10-26 22:36:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-26 22:36:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2018-10-26 22:36:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-26 22:36:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-10-26 22:36:57,925 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 176 [2018-10-26 22:36:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:36:57,925 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-10-26 22:36:57,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-26 22:36:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-10-26 22:36:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 22:36:57,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:36:57,927 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:36:57,927 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:36:57,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:36:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1341855388, now seen corresponding path program 32 times [2018-10-26 22:36:57,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:36:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:36:57,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:36:57,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:36:57,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:36:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:36:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 950 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:36:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:36:59,841 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:36:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:36:59,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:36:59,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:36:59,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:37:00,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:37:00,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:37:00,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:37:00,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:37:00,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:37:00,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 22:37:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:37:01,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:37:01,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49] total 97 [2018-10-26 22:37:01,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-26 22:37:01,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-26 22:37:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=958, Invalid=8354, Unknown=0, NotChecked=0, Total=9312 [2018-10-26 22:37:01,966 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 97 states. [2018-10-26 22:37:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:37:08,991 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2018-10-26 22:37:08,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-26 22:37:08,991 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 181 [2018-10-26 22:37:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:37:08,992 INFO L225 Difference]: With dead ends: 313 [2018-10-26 22:37:08,992 INFO L226 Difference]: Without dead ends: 195 [2018-10-26 22:37:08,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9447 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2118, Invalid=27638, Unknown=0, NotChecked=0, Total=29756 [2018-10-26 22:37:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-26 22:37:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2018-10-26 22:37:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-26 22:37:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-10-26 22:37:09,039 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 181 [2018-10-26 22:37:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:37:09,039 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-10-26 22:37:09,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-26 22:37:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-10-26 22:37:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 22:37:09,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:37:09,040 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:37:09,041 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:37:09,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:37:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1435068977, now seen corresponding path program 33 times [2018-10-26 22:37:09,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:37:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:37:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:37:09,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:37:09,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:37:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:37:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 1050 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:37:10,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:37:10,822 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:37:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:37:15,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-26 22:37:15,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:37:15,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:37:15,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:37:15,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:37:15,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:37:15,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:37:15,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:37:15,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 Received shutdown request... [2018-10-26 22:37:17,616 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-26 22:37:17,817 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:37:17,818 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 22:37:17,823 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 22:37:17,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:37:17 BoogieIcfgContainer [2018-10-26 22:37:17,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:37:17,824 INFO L168 Benchmark]: Toolchain (without parser) took 249536.71 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 933.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -116.8 MB). Peak memory consumption was 816.4 MB. Max. memory is 7.1 GB. [2018-10-26 22:37:17,825 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:37:17,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-26 22:37:17,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:37:17,825 INFO L168 Benchmark]: Boogie Preprocessor took 41.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:37:17,825 INFO L168 Benchmark]: RCFGBuilder took 512.91 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -755.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-10-26 22:37:17,826 INFO L168 Benchmark]: TraceAbstraction took 248613.48 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 217.1 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 628.4 MB). Peak memory consumption was 845.4 MB. Max. memory is 7.1 GB. [2018-10-26 22:37:17,827 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.98 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 53.32 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 41.86 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 512.91 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -755.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248613.48 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 217.1 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 628.4 MB). Peak memory consumption was 845.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 190 with TraceHistMax 24,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 78 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. TIMEOUT Result, 248.5s OverallTime, 36 OverallIterations, 24 TraceHistogramMax, 152.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1513 SDtfs, 5116 SDslu, 43928 SDs, 0 SdLazy, 52615 SolverSat, 3627 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 41.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5408 GetRequests, 2552 SyntacticMatches, 55 SemanticMatches, 2801 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89067 ImplicationChecksByTransitivity, 168.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 131 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 9.3s SatisfiabilityAnalysisTime, 73.7s InterpolantComputationTime, 6371 NumberOfCodeBlocks, 6371 NumberOfCodeBlocksAsserted, 259 NumberOfCheckSat, 6303 ConstructedInterpolants, 593 QuantifiedInterpolants, 12813730 SizeOfPredicates, 699 NumberOfNonLiveVariables, 13963 ConjunctsInSsa, 2367 ConjunctsInUnsatCore, 68 InterpolantComputations, 2 PerfectInterpolantSequences, 9412/42038 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown