java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:10:59,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:10:59,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:10:59,747 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:10:59,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:10:59,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:10:59,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:10:59,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:10:59,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:10:59,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:10:59,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:10:59,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:10:59,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:10:59,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:10:59,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:10:59,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:10:59,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:10:59,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:10:59,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:10:59,776 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:10:59,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:10:59,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:10:59,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:10:59,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:10:59,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:10:59,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:10:59,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:10:59,793 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:10:59,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:10:59,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:10:59,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:10:59,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:10:59,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:10:59,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:10:59,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:10:59,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:10:59,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:10:59,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:10:59,827 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:10:59,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:10:59,831 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:10:59,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:10:59,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:10:59,835 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:10:59,835 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:10:59,835 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:10:59,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:10:59,835 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:10:59,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:10:59,836 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:10:59,836 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:10:59,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:10:59,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:10:59,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:10:59,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:10:59,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:10:59,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:10:59,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:10:59,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:10:59,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:10:59,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:10:59,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:10:59,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:10:59,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:10:59,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:10:59,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:10:59,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:10:59,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:10:59,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:10:59,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:10:59,918 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:10:59,919 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:10:59,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-30 20:10:59,920 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-09-30 20:10:59,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:10:59,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:10:59,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:10:59,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:10:59,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:10:59,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:11:00,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:11:00,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:11:00,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:11:00,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... [2018-09-30 20:11:00,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:11:00,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:11:00,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:11:00,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:11:00,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:11:00,115 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-30 20:11:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:11:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:11:00,403 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:11:00,404 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:11:00 BoogieIcfgContainer [2018-09-30 20:11:00,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:11:00,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:11:00,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:11:00,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:11:00,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:10:59" (1/2) ... [2018-09-30 20:11:00,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4082fe and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:11:00, skipping insertion in model container [2018-09-30 20:11:00,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:11:00" (2/2) ... [2018-09-30 20:11:00,413 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-30 20:11:00,423 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:11:00,432 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:11:00,486 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:11:00,487 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:11:00,487 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:11:00,487 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:11:00,488 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:11:00,488 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:11:00,488 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:11:00,488 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:11:00,488 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:11:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-30 20:11:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 20:11:00,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:00,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 20:11:00,513 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:00,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-09-30 20:11:00,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:00,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:00,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:11:00,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:11:00,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:11:00,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:11:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:11:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:11:00,677 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-30 20:11:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:00,745 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-09-30 20:11:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:11:00,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-30 20:11:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:00,761 INFO L225 Difference]: With dead ends: 11 [2018-09-30 20:11:00,762 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 20:11:00,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:11:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 20:11:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-30 20:11:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 20:11:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-30 20:11:00,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-09-30 20:11:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:00,802 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-30 20:11:00,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:11:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-30 20:11:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:11:00,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:00,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:11:00,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:00,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-09-30 20:11:00,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:00,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:11:00,924 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:11:00,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:11:00,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:11:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:11:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:11:00,928 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-09-30 20:11:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:01,041 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-30 20:11:01,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:11:01,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-30 20:11:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:01,042 INFO L225 Difference]: With dead ends: 11 [2018-09-30 20:11:01,042 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 20:11:01,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:11:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 20:11:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 20:11:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 20:11:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-30 20:11:01,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-30 20:11:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:01,046 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-30 20:11:01,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:11:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-30 20:11:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 20:11:01,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:01,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 20:11:01,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-09-30 20:11:01,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:11:01,133 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:01,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:01,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:11:01,339 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:01,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 20:11:01,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:11:01,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:11:01,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:11:01,340 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-09-30 20:11:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:01,397 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-09-30 20:11:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:11:01,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-30 20:11:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:01,400 INFO L225 Difference]: With dead ends: 13 [2018-09-30 20:11:01,401 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 20:11:01,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:11:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 20:11:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 20:11:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 20:11:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-30 20:11:01,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-09-30 20:11:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:01,407 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-30 20:11:01,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:11:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-30 20:11:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:11:01,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:01,409 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-30 20:11:01,410 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:01,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-09-30 20:11:01,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:01,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:01,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:11:01,690 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:01,690 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:11:01,754 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:11:01,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:01,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 20:11:01,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:01,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-09-30 20:11:01,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:11:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:11:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:11:01,910 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2018-09-30 20:11:02,116 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 20:11:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:02,349 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-09-30 20:11:02,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:11:02,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-30 20:11:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:02,350 INFO L225 Difference]: With dead ends: 24 [2018-09-30 20:11:02,350 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 20:11:02,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:11:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 20:11:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-09-30 20:11:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 20:11:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-09-30 20:11:02,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-09-30 20:11:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:02,359 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-09-30 20:11:02,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:11:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-09-30 20:11:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:11:02,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:02,360 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-09-30 20:11:02,361 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:02,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-09-30 20:11:02,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:02,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:02,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:02,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-30 20:11:02,618 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:02,618 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:11:02,737 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 20:11:02,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:02,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-30 20:11:02,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:02,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-09-30 20:11:02,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:11:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:11:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:11:02,956 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-09-30 20:11:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:03,006 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-09-30 20:11:03,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:11:03,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-30 20:11:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:03,008 INFO L225 Difference]: With dead ends: 24 [2018-09-30 20:11:03,008 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 20:11:03,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:11:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 20:11:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-30 20:11:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 20:11:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-09-30 20:11:03,022 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-09-30 20:11:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:03,022 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-09-30 20:11:03,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:11:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-09-30 20:11:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:11:03,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:03,023 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-09-30 20:11:03,024 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:03,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-09-30 20:11:03,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:03,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:03,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-30 20:11:03,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:03,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:11:03,204 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:11:03,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:03,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-30 20:11:03,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:03,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 20:11:03,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:11:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:11:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:11:03,348 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-09-30 20:11:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:03,382 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-09-30 20:11:03,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:11:03,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-09-30 20:11:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:03,389 INFO L225 Difference]: With dead ends: 27 [2018-09-30 20:11:03,389 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 20:11:03,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:11:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 20:11:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-30 20:11:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-30 20:11:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-09-30 20:11:03,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-09-30 20:11:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:03,399 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-09-30 20:11:03,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:11:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-09-30 20:11:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:11:03,402 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:03,402 INFO L375 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-09-30 20:11:03,402 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:03,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 5 times [2018-09-30 20:11:03,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:03,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-30 20:11:03,536 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:03,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:03,547 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:11:03,573 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-30 20:11:03,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:03,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-30 20:11:03,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:03,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-09-30 20:11:03,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:11:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:11:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:11:03,763 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-09-30 20:11:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:03,838 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-09-30 20:11:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:11:03,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-09-30 20:11:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:03,842 INFO L225 Difference]: With dead ends: 30 [2018-09-30 20:11:03,842 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 20:11:03,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:11:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 20:11:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-30 20:11:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-30 20:11:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-09-30 20:11:03,850 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-09-30 20:11:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:03,850 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-09-30 20:11:03,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:11:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-09-30 20:11:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 20:11:03,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:03,851 INFO L375 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-09-30 20:11:03,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:03,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 6 times [2018-09-30 20:11:03,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:03,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:03,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-30 20:11:04,242 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:04,242 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:04,250 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:11:04,273 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-09-30 20:11:04,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:04,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 20:11:04,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:04,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-09-30 20:11:04,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:11:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:11:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:11:04,376 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 13 states. [2018-09-30 20:11:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:05,402 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-09-30 20:11:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:11:05,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-09-30 20:11:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:05,404 INFO L225 Difference]: With dead ends: 50 [2018-09-30 20:11:05,404 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 20:11:05,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=597, Invalid=1295, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:11:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 20:11:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-09-30 20:11:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 20:11:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-09-30 20:11:05,417 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2018-09-30 20:11:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:05,417 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-09-30 20:11:05,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:11:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-09-30 20:11:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:11:05,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:05,418 INFO L375 BasicCegarLoop]: trace histogram [21, 3, 3, 1, 1, 1] [2018-09-30 20:11:05,419 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:05,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:05,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1893667570, now seen corresponding path program 7 times [2018-09-30 20:11:05,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:05,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:05,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:05,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:05,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-30 20:11:05,589 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:05,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:05,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:05,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-30 20:11:05,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:05,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-09-30 20:11:05,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 20:11:05,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 20:11:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:11:05,854 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 19 states. [2018-09-30 20:11:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:05,935 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-30 20:11:05,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:11:05,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-09-30 20:11:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:05,938 INFO L225 Difference]: With dead ends: 55 [2018-09-30 20:11:05,938 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 20:11:05,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:11:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 20:11:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 20:11:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 20:11:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-09-30 20:11:05,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-09-30 20:11:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:05,948 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-09-30 20:11:05,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 20:11:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-09-30 20:11:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 20:11:05,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:05,949 INFO L375 BasicCegarLoop]: trace histogram [24, 3, 3, 1, 1, 1] [2018-09-30 20:11:05,949 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:05,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1170740991, now seen corresponding path program 8 times [2018-09-30 20:11:05,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:05,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:05,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-30 20:11:06,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:06,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:06,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:11:06,156 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:11:06,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:06,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-30 20:11:06,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:06,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-09-30 20:11:06,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 20:11:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 20:11:06,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:11:06,372 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 21 states. [2018-09-30 20:11:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:06,608 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-09-30 20:11:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:11:06,608 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-09-30 20:11:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:06,609 INFO L225 Difference]: With dead ends: 60 [2018-09-30 20:11:06,609 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 20:11:06,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:11:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 20:11:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-30 20:11:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 20:11:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-09-30 20:11:06,629 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-09-30 20:11:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:06,629 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-09-30 20:11:06,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 20:11:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-09-30 20:11:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 20:11:06,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:06,631 INFO L375 BasicCegarLoop]: trace histogram [27, 3, 3, 1, 1, 1] [2018-09-30 20:11:06,631 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:06,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 251197998, now seen corresponding path program 9 times [2018-09-30 20:11:06,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:06,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:06,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:06,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-30 20:11:07,026 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:07,026 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:07,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:11:07,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-30 20:11:07,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:07,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-09-30 20:11:07,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:07,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-09-30 20:11:07,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 20:11:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 20:11:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:11:07,654 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 23 states. [2018-09-30 20:11:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:07,836 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-09-30 20:11:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:11:07,839 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-09-30 20:11:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:07,839 INFO L225 Difference]: With dead ends: 65 [2018-09-30 20:11:07,840 INFO L226 Difference]: Without dead ends: 40 [2018-09-30 20:11:07,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:11:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-30 20:11:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-30 20:11:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-30 20:11:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-09-30 20:11:07,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2018-09-30 20:11:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:07,856 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-09-30 20:11:07,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 20:11:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-09-30 20:11:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 20:11:07,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:07,858 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-09-30 20:11:07,859 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:07,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 10 times [2018-09-30 20:11:07,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:07,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:07,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-30 20:11:08,007 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:08,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:08,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:11:08,071 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:11:08,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:08,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-30 20:11:08,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:08,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 20:11:08,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:11:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:11:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:11:08,223 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-09-30 20:11:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:08,262 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-09-30 20:11:08,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:11:08,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-09-30 20:11:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:08,265 INFO L225 Difference]: With dead ends: 65 [2018-09-30 20:11:08,265 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 20:11:08,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:11:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 20:11:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-09-30 20:11:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:11:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-09-30 20:11:08,278 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-09-30 20:11:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:08,279 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-09-30 20:11:08,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:11:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-09-30 20:11:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 20:11:08,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:08,280 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-09-30 20:11:08,281 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:08,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 11 times [2018-09-30 20:11:08,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:08,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:08,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-30 20:11:08,462 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:08,462 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:11:08,530 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 20:11:08,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:08,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-30 20:11:08,677 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:08,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 20:11:08,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:11:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:11:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:11:08,679 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-09-30 20:11:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:08,855 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-09-30 20:11:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:11:08,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-09-30 20:11:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:08,856 INFO L225 Difference]: With dead ends: 77 [2018-09-30 20:11:08,857 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 20:11:08,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:11:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 20:11:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-09-30 20:11:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 20:11:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-09-30 20:11:08,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-09-30 20:11:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:08,876 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-09-30 20:11:08,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:11:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-09-30 20:11:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-30 20:11:08,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:08,878 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-09-30 20:11:08,878 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:08,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 12 times [2018-09-30 20:11:08,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:08,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:08,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:08,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-30 20:11:09,227 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:09,227 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:11:09,309 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-09-30 20:11:09,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:09,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-30 20:11:09,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:09,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:11:09,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:11:09,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:11:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:11:09,494 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-09-30 20:11:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:09,559 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-09-30 20:11:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:11:09,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-30 20:11:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:09,560 INFO L225 Difference]: With dead ends: 89 [2018-09-30 20:11:09,560 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 20:11:09,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:11:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 20:11:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-09-30 20:11:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 20:11:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-09-30 20:11:09,579 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-09-30 20:11:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:09,580 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-09-30 20:11:09,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:11:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-09-30 20:11:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 20:11:09,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:09,581 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-09-30 20:11:09,582 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:09,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 13 times [2018-09-30 20:11:09,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:09,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:09,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-30 20:11:09,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:09,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:09,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:09,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-30 20:11:10,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:10,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 20:11:10,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:11:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:11:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:11:10,008 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-09-30 20:11:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:10,223 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-09-30 20:11:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:11:10,224 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-09-30 20:11:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:10,225 INFO L225 Difference]: With dead ends: 101 [2018-09-30 20:11:10,225 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 20:11:10,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:11:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 20:11:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-30 20:11:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-30 20:11:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-09-30 20:11:10,251 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-09-30 20:11:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:10,252 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-09-30 20:11:10,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:11:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-09-30 20:11:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 20:11:10,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:10,257 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-09-30 20:11:10,257 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:10,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 14 times [2018-09-30 20:11:10,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:10,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:10,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:10,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:11:10,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-09-30 20:11:10,563 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:10,564 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:10,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:11:10,639 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:11:10,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:10,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-09-30 20:11:10,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:10,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 20:11:10,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:11:10,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:11:10,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:11:10,989 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-09-30 20:11:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:11,259 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-09-30 20:11:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:11:11,260 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-09-30 20:11:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:11,261 INFO L225 Difference]: With dead ends: 113 [2018-09-30 20:11:11,261 INFO L226 Difference]: Without dead ends: 111 [2018-09-30 20:11:11,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:11:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-30 20:11:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-09-30 20:11:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 20:11:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-09-30 20:11:11,285 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-09-30 20:11:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:11,285 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-09-30 20:11:11,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:11:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-09-30 20:11:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 20:11:11,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:11,288 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-09-30 20:11:11,288 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:11,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:11,289 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 15 times [2018-09-30 20:11:11,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:11,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:11,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:11,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:11,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-30 20:11:12,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:12,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:11:12,166 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-09-30 20:11:12,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:12,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-30 20:11:12,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:12,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 20:11:12,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:11:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:11:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:11:12,339 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-09-30 20:11:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:12,437 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-09-30 20:11:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:11:12,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-09-30 20:11:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:12,440 INFO L225 Difference]: With dead ends: 125 [2018-09-30 20:11:12,440 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 20:11:12,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:11:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 20:11:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-09-30 20:11:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 20:11:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-09-30 20:11:12,468 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-09-30 20:11:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:12,480 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-09-30 20:11:12,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:11:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-09-30 20:11:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-30 20:11:12,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:12,482 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-09-30 20:11:12,482 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:12,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 16 times [2018-09-30 20:11:12,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:12,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:12,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:12,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:12,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-09-30 20:11:12,798 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:11:12,798 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:11:12,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:11:12,885 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:11:12,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:11:12,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:11:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-09-30 20:11:13,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:11:13,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 20:11:13,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:11:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:11:13,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:11:13,088 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-09-30 20:11:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:13,166 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-09-30 20:11:13,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:11:13,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-09-30 20:11:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:13,168 INFO L225 Difference]: With dead ends: 137 [2018-09-30 20:11:13,168 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 20:11:13,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:11:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 20:11:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-09-30 20:11:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-30 20:11:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-09-30 20:11:13,197 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-09-30 20:11:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:13,197 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-09-30 20:11:13,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:11:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-09-30 20:11:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-30 20:11:13,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:11:13,198 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-09-30 20:11:13,199 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:11:13,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:11:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 17 times [2018-09-30 20:11:13,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:11:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:11:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:13,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:11:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:11:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:11:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 20:11:19,923 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:11:19,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-30 20:11:19,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-30 20:11:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-30 20:11:19,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 20:11:19,929 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-09-30 20:11:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:11:22,426 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-09-30 20:11:22,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-30 20:11:22,426 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-09-30 20:11:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:11:22,427 INFO L225 Difference]: With dead ends: 5119 [2018-09-30 20:11:22,427 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:11:22,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 20:11:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:11:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:11:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:11:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:11:22,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-09-30 20:11:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:11:22,441 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:11:22,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-30 20:11:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:11:22,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:11:22,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:11:28,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:28,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:29,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:30,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:31,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:32,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:33,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:34,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:35,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:36,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:37,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:37,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:38,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:39,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:39,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:39,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:39,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:39,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:40,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:40,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:40,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:40,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:40,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:41,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:42,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:42,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:43,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:43,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:43,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:44,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:44,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:44,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:44,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:45,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:46,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:46,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:46,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:47,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:47,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:48,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:48,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:48,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:48,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:49,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:50,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:50,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:50,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:51,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:51,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:51,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:52,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:53,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:53,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:55,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:55,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:55,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:55,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:57,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:57,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:57,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:58,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:58,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:58,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:58,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:58,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:59,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:11:59,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:00,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:00,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:02,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:02,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:03,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:03,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:03,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:03,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:04,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:05,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:05,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:06,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:08,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:08,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:09,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:09,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:10,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:11,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:12,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:12,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:13,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:19,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:20,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:22,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:22,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:22,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:25,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:29,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:29,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:32,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:34,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:35,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:36,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:12:51,663 WARN L178 SmtUtils]: Spent 1.49 m on a formula simplification. DAG size of input: 5112 DAG size of output: 2150 [2018-09-30 20:12:52,733 WARN L178 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-09-30 20:14:25,221 WARN L178 SmtUtils]: Spent 1.54 m on a formula simplification. DAG size of input: 2150 DAG size of output: 362 [2018-09-30 20:14:31,584 WARN L178 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-09-30 20:14:31,591 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-09-30 20:14:31,593 INFO L422 ceAbstractionStarter]: At program point L64(lines 49 65) the Hoare annotation is: (let ((.cse24 (<= ULTIMATE.start_main_~j~5 7)) (.cse13 (<= ULTIMATE.start_main_~j~5 1)) (.cse11 (<= ULTIMATE.start_main_~j~5 9)) (.cse27 (<= ULTIMATE.start_main_~j~5 2)) (.cse39 (<= ULTIMATE.start_main_~j~5 0)) (.cse19 (<= ULTIMATE.start_main_~j~5 5)) (.cse21 (<= ULTIMATE.start_main_~j~5 3)) (.cse35 (<= ULTIMATE.start_main_~j~5 8)) (.cse31 (<= ULTIMATE.start_main_~j~5 4)) (.cse32 (<= ULTIMATE.start_main_~j~5 6)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5))) (let ((.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse26 (<= 90 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse36 (<= 30 ULTIMATE.start_main_~k~5)) (.cse8 (<= 40 ULTIMATE.start_main_~k~5)) (.cse37 (<= 50 ULTIMATE.start_main_~k~5)) (.cse30 (<= ULTIMATE.start_main_~i~5 2)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse20 (and .cse32 .cse4)) (.cse33 (and .cse31 .cse4)) (.cse1 (<= ULTIMATE.start_main_~i~5 5)) (.cse28 (and .cse35 .cse4)) (.cse12 (and .cse21 .cse4)) (.cse23 (and .cse19 .cse4)) (.cse10 (and .cse4 .cse39)) (.cse18 (<= 80 ULTIMATE.start_main_~k~5)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse22 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse29 (and .cse4 .cse27)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse14 (<= ULTIMATE.start_main_~i~5 0)) (.cse25 (<= ULTIMATE.start_main_~i~5 8)) (.cse38 (and .cse4 .cse11)) (.cse9 (<= ULTIMATE.start_main_~i~5 4)) (.cse17 (<= ULTIMATE.start_main_~i~5 3)) (.cse15 (and .cse13 .cse4)) (.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse2 (and .cse24 .cse4)) (.cse16 (<= ULTIMATE.start_main_~i~5 7))) (or (and .cse0 .cse1 (<= 57 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10) (and .cse0 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse11) (and .cse0 .cse12 .cse7 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 1 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse14) (and .cse0 (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse16) (and .cse0 .cse17 .cse4 .cse11 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse0 .cse4 .cse18 .cse16) (and .cse0 .cse19 .cse17 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse9) (and .cse0 .cse21 .cse17 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and (and .cse22 .cse23) (<= 95 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 7 ULTIMATE.start_main_~k~5) .cse24 .cse4 .cse14) (and .cse0 .cse25 .cse26 .cse4) (and .cse0 (<= 32 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse27) (and .cse0 (<= 78 ULTIMATE.start_main_~k~5) .cse28 .cse16) (and .cse0 .cse25 (<= 82 ULTIMATE.start_main_~k~5) .cse29) (and .cse0 .cse30 .cse21 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse4 .cse11 (<= 9 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse31 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 (<= 3 ULTIMATE.start_main_~k~5) .cse21 .cse4 .cse14) (and .cse0 .cse32 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse14) (and .cse0 .cse24 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse0 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse27 .cse14) (and .cse0 .cse30 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse27) (and (<= 74 ULTIMATE.start_main_~k~5) .cse0 .cse33 .cse16) (and .cse0 .cse34 .cse10 .cse7) (and .cse0 .cse1 (<= 51 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 (<= 42 ULTIMATE.start_main_~k~5) .cse29 .cse9) (and .cse0 .cse6 .cse10 .cse16) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse22 .cse28)) (and .cse0 .cse25 (<= 87 ULTIMATE.start_main_~k~5) .cse2) (and .cse0 (<= 29 ULTIMATE.start_main_~k~5) .cse30 .cse4 .cse11) (and .cse0 .cse30 (<= 25 ULTIMATE.start_main_~k~5) .cse19 .cse4) (and .cse0 (<= 56 ULTIMATE.start_main_~k~5) .cse1 .cse20) (and .cse0 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse27) (and .cse0 (<= 53 ULTIMATE.start_main_~k~5) .cse1 .cse12) (and .cse0 (<= 45 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse9) (and .cse0 (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse7) (and (<= 93 ULTIMATE.start_main_~k~5) (and .cse22 .cse12)) (and .cse0 .cse1 (<= 55 ULTIMATE.start_main_~k~5) .cse23) (and .cse0 .cse21 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse25 (<= 83 ULTIMATE.start_main_~k~5) .cse12) (and .cse0 .cse32 .cse30 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and .cse26 (and .cse22 .cse10)) (and .cse0 .cse25 (<= 88 ULTIMATE.start_main_~k~5) .cse28) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse22 .cse4)) (and .cse0 .cse1 .cse29 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse0 .cse35 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse9) (and .cse0 .cse30 .cse4 .cse36) (and .cse0 .cse25 (<= 86 ULTIMATE.start_main_~k~5) .cse20) (and .cse0 .cse33 .cse9 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 18 ULTIMATE.start_main_~k~5) .cse35 .cse4 .cse5) (and .cse0 .cse37 .cse9 .cse4) (and .cse0 .cse31 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse28 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse0 .cse30 (<= 21 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse0 (<= 11 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse5) (and .cse0 .cse38 (<= 69 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse25 (<= 85 ULTIMATE.start_main_~k~5) .cse23) (and .cse0 (<= 54 ULTIMATE.start_main_~k~5) .cse1 .cse33) (and .cse0 .cse19 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse38 .cse1 (<= 59 ULTIMATE.start_main_~k~5)) (and .cse0 .cse3 .cse30 .cse4 .cse39) (and (and .cse22 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse0 .cse23 (<= 65 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse17 .cse4 .cse39 .cse36) (and .cse0 .cse30 .cse31 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse35 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse14) (and .cse0 .cse32 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and (and .cse22 .cse2) (<= 97 ULTIMATE.start_main_~k~5)) (and .cse0 .cse8 .cse17 .cse4) (and (and .cse22 .cse15) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 41 ULTIMATE.start_main_~k~5) .cse9) (and .cse0 .cse33 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse2 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse0 .cse19 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse0 .cse30 (<= 27 ULTIMATE.start_main_~k~5) .cse24 .cse4) (and .cse0 .cse37 .cse1 .cse10) (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse39 .cse14) (and .cse0 .cse30 .cse35 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 .cse17 .cse24 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse0 .cse38 (<= 79 ULTIMATE.start_main_~k~5) .cse16) (and (and .cse22 .cse33) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse0 .cse4 .cse1 .cse34) (and (and .cse22 .cse20) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse0 .cse35 (<= 38 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse25 (<= 84 ULTIMATE.start_main_~k~5) .cse33) (and .cse0 .cse1 .cse28 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse0 .cse24 .cse4 (<= 47 ULTIMATE.start_main_~k~5) .cse9) (and .cse0 (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse16) (and .cse0 .cse23 .cse16 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse21 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse9) (and .cse0 .cse31 (<= 34 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse0 .cse32 .cse17 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse0 (<= 72 ULTIMATE.start_main_~k~5) .cse29 .cse16) (and .cse0 .cse25 .cse10 .cse18) (and .cse0 .cse29 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse0 .cse40 .cse4 .cse39 .cse5) (and (and .cse22 .cse29) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse0 .cse25 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse0 .cse40 .cse4 .cse14) (and .cse0 .cse25 (<= 81 ULTIMATE.start_main_~k~5) .cse15) (and .cse0 .cse38 .cse9 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse0 .cse17 .cse15 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 77 ULTIMATE.start_main_~k~5) .cse2 .cse16)))) [2018-09-30 20:14:31,593 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-09-30 20:14:31,593 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-09-30 20:14:31,593 INFO L422 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-09-30 20:14:31,594 INFO L422 ceAbstractionStarter]: At program point L70(lines 33 70) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-09-30 20:14:31,594 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-09-30 20:14:31,629 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:14:31 BoogieIcfgContainer [2018-09-30 20:14:31,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:14:31,631 INFO L168 Benchmark]: Toolchain (without parser) took 211663.63 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 411.8 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-09-30 20:14:31,632 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:14:31,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:14:31,633 INFO L168 Benchmark]: Boogie Preprocessor took 21.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:14:31,633 INFO L168 Benchmark]: RCFGBuilder took 370.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:14:31,634 INFO L168 Benchmark]: TraceAbstraction took 211224.00 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 390.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-09-30 20:14:31,652 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 370.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211224.00 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 390.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 6) && 63 <= main_~k~5)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || (((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((10 <= main_~n~5 && 76 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 78 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 82 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 42 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 87 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (93 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 55 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 83 <= main_~k~5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 86 <= main_~k~5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 4) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 69 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 85 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 5) && 59 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && 65 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 4) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 41 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 79 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 47 <= main_~k~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && 73 <= main_~k~5) && main_~j~5 <= 3 && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 4) && 49 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1 && 10 <= main_~m~5) && 31 <= main_~k~5)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 211.1s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 189.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 398 SDslu, 417 SDs, 0 SdLazy, 636 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=18, 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 90 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 5119 NumberOfFragments, 1927 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3229534 FormulaSimplificationTreeSizeReduction, 90.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 251704 FormulaSimplificationTreeSizeReductionInter, 98.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1533 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 571602 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3238 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 12968/42447 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-14-31-682.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-14-31-682.csv Received shutdown request...