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_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:38:23,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:38:23,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:38:23,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:38:23,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:38:23,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:38:23,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:38:23,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:38:23,464 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:38:23,465 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:38:23,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:38:23,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:38:23,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:38:23,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:38:23,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:38:23,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:38:23,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:38:23,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:38:23,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:38:23,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:38:23,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:38:23,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:38:23,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:38:23,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:38:23,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:38:23,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:38:23,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:38:23,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:38:23,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:38:23,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:38:23,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:38:23,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:38:23,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:38:23,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:38:23,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:38:23,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:38:23,495 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:38:23,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:38:23,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:38:23,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:38:23,514 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:38:23,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:38:23,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:38:23,515 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:38:23,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:38:23,516 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:38:23,516 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:38:23,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:38:23,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:38:23,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:38:23,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:38:23,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:38:23,517 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:38:23,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:38:23,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:38:23,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:38:23,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:38:23,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:38:23,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:38:23,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:38:23,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:38:23,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:38:23,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:38:23,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:38:23,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:38:23,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:38:23,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:38:23,522 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:38:23,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:38:23,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:38:23,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:38:23,591 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:38:23,592 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:38:23,593 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-10-01 00:38:23,593 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-10-01 00:38:23,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:38:23,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:38:23,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:23,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:38:23,650 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:38:23,672 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,684 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:23,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:38:23,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:38:23,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:38:23,704 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,704 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,705 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,705 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,708 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,710 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,711 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 01.10 12:38:23" (1/1) ... [2018-10-01 00:38:23,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:38:23,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:38:23,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:38:23,714 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:38:23,715 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 01.10 12:38:23" (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-10-01 00:38:23,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:38:23,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:38:23,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:38:24,045 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:38:24,046 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:24 BoogieIcfgContainer [2018-10-01 00:38:24,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:38:24,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:38:24,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:38:24,050 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:38:24,051 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 01.10 12:38:23" (1/2) ... [2018-10-01 00:38:24,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2889e246 and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:38:24, skipping insertion in model container [2018-10-01 00:38:24,052 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 01.10 12:38:24" (2/2) ... [2018-10-01 00:38:24,054 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-01 00:38:24,064 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:38:24,074 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:38:24,122 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:38:24,123 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:38:24,124 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:38:24,124 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:38:24,124 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:38:24,124 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:38:24,124 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:38:24,124 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:38:24,125 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:38:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-01 00:38:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:38:24,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:24,148 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:38:24,149 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:24,156 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-01 00:38:24,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:24,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:24,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:24,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:24,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:24,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:24,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:24,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:24,324 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-01 00:38:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:24,540 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-10-01 00:38:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:24,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:38:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:24,553 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:38:24,554 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:38:24,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:38:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-01 00:38:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-01 00:38:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-01 00:38:24,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-01 00:38:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:24,590 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-01 00:38:24,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-01 00:38:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:38:24,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:24,591 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:38:24,591 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:24,591 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-10-01 00:38:24,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:24,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:24,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:24,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:24,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:24,656 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:24,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:38:24,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:38:24,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:38:24,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:24,659 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-01 00:38:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:24,786 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-01 00:38:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:38:24,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-01 00:38:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:24,788 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:38:24,789 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:38:24,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:38:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:38:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:38:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-01 00:38:24,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-10-01 00:38:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:24,793 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-01 00:38:24,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:38:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-01 00:38:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:38:24,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:24,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-01 00:38:24,795 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:24,795 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-10-01 00:38:24,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:24,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:24,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:24,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:24,887 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:24,888 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-10-01 00:38:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:24,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:25,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:25,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-01 00:38:25,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:38:25,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:38:25,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:25,095 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2018-10-01 00:38:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:25,493 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-10-01 00:38:25,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:38:25,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-01 00:38:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:25,495 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:38:25,495 INFO L226 Difference]: Without dead ends: 8 [2018-10-01 00:38:25,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-01 00:38:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-01 00:38:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 00:38:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-01 00:38:25,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-10-01 00:38:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:25,500 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-01 00:38:25,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:38:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-01 00:38:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:38:25,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:25,501 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-01 00:38:25,502 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:25,502 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-10-01 00:38:25,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:25,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:25,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:25,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:25,628 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-10-01 00:38:25,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:25,651 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:25,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:25,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-01 00:38:25,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:25,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-10-01 00:38:25,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:38:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:38:25,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:25,739 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2018-10-01 00:38:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:26,837 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-10-01 00:38:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:38:26,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-01 00:38:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:26,841 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:38:26,841 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:38:26,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:38:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:38:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-01 00:38:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-01 00:38:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-01 00:38:26,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-10-01 00:38:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:26,849 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-01 00:38:26,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:38:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-01 00:38:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:38:26,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:26,850 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-10-01 00:38:26,851 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:26,851 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-10-01 00:38:26,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:26,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:38:26,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:26,952 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-10-01 00:38:26,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:26,982 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-01 00:38:26,983 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:26,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:38:27,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:27,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-01 00:38:27,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:38:27,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:38:27,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:27,117 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-10-01 00:38:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:27,209 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-10-01 00:38:27,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:38:27,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-01 00:38:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:27,212 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:38:27,212 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 00:38:27,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 00:38:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-01 00:38:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-01 00:38:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-01 00:38:27,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-10-01 00:38:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:27,218 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-01 00:38:27,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:38:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-01 00:38:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:38:27,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:27,219 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-10-01 00:38:27,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:27,219 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:27,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-10-01 00:38:27,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:27,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:27,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 00:38:27,318 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:27,319 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-10-01 00:38:27,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:27,344 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:27,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:27,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 00:38:27,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:27,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-01 00:38:27,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:38:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:38:27,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:27,591 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-10-01 00:38:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:27,827 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-01 00:38:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:38:27,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-10-01 00:38:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:27,831 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:38:27,831 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:38:27,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:38:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:38:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-01 00:38:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-01 00:38:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-10-01 00:38:27,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-10-01 00:38:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:27,837 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-10-01 00:38:27,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:38:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-10-01 00:38:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:38:27,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:27,838 INFO L375 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2018-10-01 00:38:27,838 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:27,839 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash 650597027, now seen corresponding path program 5 times [2018-10-01 00:38:27,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:27,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:27,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:27,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-01 00:38:27,969 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:27,969 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-10-01 00:38:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:28,008 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-01 00:38:28,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:28,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-01 00:38:28,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:28,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-01 00:38:28,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:38:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:38:28,104 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:28,104 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-10-01 00:38:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:28,299 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-10-01 00:38:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:38:28,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-10-01 00:38:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:28,301 INFO L225 Difference]: With dead ends: 30 [2018-10-01 00:38:28,301 INFO L226 Difference]: Without dead ends: 20 [2018-10-01 00:38:28,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:38:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-01 00:38:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-01 00:38:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-01 00:38:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-01 00:38:28,306 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-10-01 00:38:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:28,307 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-01 00:38:28,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:38:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-01 00:38:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 00:38:28,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:28,308 INFO L375 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2018-10-01 00:38:28,308 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:28,308 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1318725353, now seen corresponding path program 6 times [2018-10-01 00:38:28,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:28,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:28,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:28,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:38:28,428 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:28,428 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-10-01 00:38:28,438 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:28,449 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-10-01 00:38:28,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:28,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-01 00:38:28,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:28,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-10-01 00:38:28,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:38:28,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:38:28,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:28,560 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 13 states. [2018-10-01 00:38:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:29,804 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-10-01 00:38:29,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:38:29,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-10-01 00:38:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:29,806 INFO L225 Difference]: With dead ends: 50 [2018-10-01 00:38:29,807 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:38:29,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:38:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:38:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-10-01 00:38:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:38:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-10-01 00:38:29,817 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 19 [2018-10-01 00:38:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:29,817 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-10-01 00:38:29,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:38:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-10-01 00:38:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:38:29,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:29,819 INFO L375 BasicCegarLoop]: trace histogram [21, 3, 3, 1, 1, 1] [2018-10-01 00:38:29,819 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:29,819 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1893667570, now seen corresponding path program 7 times [2018-10-01 00:38:29,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-01 00:38:29,946 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:29,946 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-10-01 00:38:29,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:29,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 131 proven. 28 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-01 00:38:30,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:30,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-01 00:38:30,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:38:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:38:30,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:30,246 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 19 states. [2018-10-01 00:38:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:30,458 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-10-01 00:38:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:38:30,466 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-10-01 00:38:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:30,466 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:38:30,467 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 00:38:30,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:38:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 00:38:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-01 00:38:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-01 00:38:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-10-01 00:38:30,478 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 30 [2018-10-01 00:38:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:30,479 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-10-01 00:38:30,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:38:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-10-01 00:38:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-01 00:38:30,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:30,480 INFO L375 BasicCegarLoop]: trace histogram [24, 3, 3, 1, 1, 1] [2018-10-01 00:38:30,481 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:30,481 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1170740991, now seen corresponding path program 8 times [2018-10-01 00:38:30,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:30,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:30,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-01 00:38:30,732 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:30,733 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-10-01 00:38:30,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:30,781 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:30,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:30,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-01 00:38:30,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:30,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-10-01 00:38:30,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:38:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:38:30,970 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:30,970 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 21 states. [2018-10-01 00:38:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:31,195 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-01 00:38:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:38:31,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-01 00:38:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:31,199 INFO L225 Difference]: With dead ends: 60 [2018-10-01 00:38:31,199 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:38:31,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:38:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:38:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:38:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:38:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-10-01 00:38:31,213 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 33 [2018-10-01 00:38:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:31,213 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-10-01 00:38:31,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:38:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-10-01 00:38:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:38:31,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:31,215 INFO L375 BasicCegarLoop]: trace histogram [27, 3, 3, 1, 1, 1] [2018-10-01 00:38:31,215 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:31,215 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 251197998, now seen corresponding path program 9 times [2018-10-01 00:38:31,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:31,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-01 00:38:31,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:31,617 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-10-01 00:38:31,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:31,794 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-01 00:38:31,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:31,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 203 proven. 45 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-01 00:38:32,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:32,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-10-01 00:38:32,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:38:32,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:38:32,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:32,183 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 23 states. [2018-10-01 00:38:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:32,489 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-10-01 00:38:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:38:32,492 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-10-01 00:38:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:32,492 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:38:32,492 INFO L226 Difference]: Without dead ends: 40 [2018-10-01 00:38:32,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:38:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-01 00:38:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-01 00:38:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-01 00:38:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-10-01 00:38:32,502 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2018-10-01 00:38:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:32,502 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-01 00:38:32,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:38:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-10-01 00:38:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 00:38:32,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:32,504 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-10-01 00:38:32,504 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:32,504 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 10 times [2018-10-01 00:38:32,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:32,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:32,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-01 00:38:32,643 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:32,643 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-10-01 00:38:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:32,707 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:32,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:32,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-01 00:38:32,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:32,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-01 00:38:32,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:38:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:38:32,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:32,958 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2018-10-01 00:38:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:33,209 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-10-01 00:38:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:38:33,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-01 00:38:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:33,211 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:38:33,211 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:38:33,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:38:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:38:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-10-01 00:38:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-01 00:38:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-01 00:38:33,227 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-10-01 00:38:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:33,227 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-01 00:38:33,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:38:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-01 00:38:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-01 00:38:33,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:33,229 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-10-01 00:38:33,229 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:33,230 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:33,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 11 times [2018-10-01 00:38:33,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:33,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:33,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:33,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:33,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-01 00:38:33,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:33,383 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-10-01 00:38:33,390 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:33,453 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-01 00:38:33,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:33,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-10-01 00:38:34,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:34,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-01 00:38:34,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:38:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:38:34,151 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:34,151 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-10-01 00:38:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:34,240 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-10-01 00:38:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:38:34,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-01 00:38:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:34,243 INFO L225 Difference]: With dead ends: 77 [2018-10-01 00:38:34,243 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:38:34,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:38:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:38:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-10-01 00:38:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-01 00:38:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-10-01 00:38:34,259 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-10-01 00:38:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-10-01 00:38:34,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:38:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-10-01 00:38:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-01 00:38:34,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:34,261 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-10-01 00:38:34,261 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:34,261 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 12 times [2018-10-01 00:38:34,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:34,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-01 00:38:34,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:34,631 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-10-01 00:38:34,638 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:34,748 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-01 00:38:34,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:34,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-01 00:38:34,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:34,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:38:34,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:38:34,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:38:34,996 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:34,996 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 14 states. [2018-10-01 00:38:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:35,134 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-10-01 00:38:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:38:35,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-10-01 00:38:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:35,135 INFO L225 Difference]: With dead ends: 89 [2018-10-01 00:38:35,135 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:38:35,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:38:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-10-01 00:38:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-01 00:38:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-10-01 00:38:35,155 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-10-01 00:38:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:35,155 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-10-01 00:38:35,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:38:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-10-01 00:38:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 00:38:35,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:35,157 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-10-01 00:38:35,157 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:35,157 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 13 times [2018-10-01 00:38:35,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:35,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:35,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-01 00:38:35,338 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:35,338 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-10-01 00:38:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:35,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-01 00:38:35,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:35,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-01 00:38:35,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:38:35,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:38:35,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:35,650 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 16 states. [2018-10-01 00:38:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:35,786 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-10-01 00:38:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:38:35,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-10-01 00:38:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:35,788 INFO L225 Difference]: With dead ends: 101 [2018-10-01 00:38:35,788 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:38:35,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:38:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:38:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-10-01 00:38:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-01 00:38:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-10-01 00:38:35,810 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-10-01 00:38:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:35,810 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-01 00:38:35,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:38:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-10-01 00:38:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-01 00:38:35,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:35,812 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-10-01 00:38:35,812 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:35,812 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 14 times [2018-10-01 00:38:35,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:35,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:35,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-01 00:38:36,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:36,034 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-10-01 00:38:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:36,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:36,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:36,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-01 00:38:36,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:36,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-01 00:38:36,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:38:36,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:38:36,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:36,674 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 18 states. [2018-10-01 00:38:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:36,896 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-10-01 00:38:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:38:36,896 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-10-01 00:38:36,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:36,897 INFO L225 Difference]: With dead ends: 113 [2018-10-01 00:38:36,898 INFO L226 Difference]: Without dead ends: 111 [2018-10-01 00:38:36,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:38:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-01 00:38:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-10-01 00:38:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-01 00:38:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-10-01 00:38:36,924 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-10-01 00:38:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:36,925 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-01 00:38:36,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:38:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-10-01 00:38:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-01 00:38:36,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:36,927 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-10-01 00:38:36,927 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:36,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 15 times [2018-10-01 00:38:36,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:36,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:36,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 00:38:37,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:37,773 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-10-01 00:38:37,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:37,896 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-10-01 00:38:37,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:37,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 00:38:38,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:38,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-01 00:38:38,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:38:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:38:38,154 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:38,154 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 20 states. [2018-10-01 00:38:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:38,286 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-10-01 00:38:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:38:38,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-10-01 00:38:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:38,288 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:38:38,288 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:38:38,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:38:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:38:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-10-01 00:38:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-01 00:38:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-10-01 00:38:38,316 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-10-01 00:38:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:38,316 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-10-01 00:38:38,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:38:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-10-01 00:38:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-01 00:38:38,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:38,318 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-10-01 00:38:38,318 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:38,318 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:38,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 16 times [2018-10-01 00:38:38,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:38,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:38,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:38,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-01 00:38:38,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:38,978 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-10-01 00:38:38,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:39,086 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:39,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:39,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-01 00:38:39,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:39,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-01 00:38:39,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:38:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:38:39,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:39,440 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 22 states. [2018-10-01 00:38:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:39,732 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-10-01 00:38:39,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:38:39,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-10-01 00:38:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:39,740 INFO L225 Difference]: With dead ends: 137 [2018-10-01 00:38:39,740 INFO L226 Difference]: Without dead ends: 135 [2018-10-01 00:38:39,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:38:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-01 00:38:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-10-01 00:38:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-01 00:38:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-10-01 00:38:39,776 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-10-01 00:38:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:39,777 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-10-01 00:38:39,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:38:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-01 00:38:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-01 00:38:39,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:39,778 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-10-01 00:38:39,778 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:39,779 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 17 times [2018-10-01 00:38:39,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:39,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:39,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-01 00:38:41,221 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:41,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-01 00:38:41,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:38:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:38:41,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:41,224 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-10-01 00:38:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:44,942 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-10-01 00:38:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:38:44,942 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-10-01 00:38:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:44,943 INFO L225 Difference]: With dead ends: 5119 [2018-10-01 00:38:44,943 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:38:44,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:38:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:38:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:38:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:38:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:38:44,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-10-01 00:38:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:44,952 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:38:44,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:38:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:38:44,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:38:44,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:38:51,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:51,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:52,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:53,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:54,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:55,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:56,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:57,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:58,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:58,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:58,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:58,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:58,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:59,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:59,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:59,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:59,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:38:59,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:00,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:00,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:00,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:00,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:00,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:00,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:01,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:01,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:01,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:01,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:02,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:02,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:02,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:02,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:02,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:02,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:03,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:03,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:03,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:03,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:04,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:05,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:05,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:05,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:06,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:06,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:06,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:06,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:07,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:07,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:07,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:08,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:09,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:09,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:09,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:10,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:11,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:11,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:11,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:12,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:13,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:13,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:13,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:14,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:14,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:15,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:15,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:17,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:17,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:18,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:19,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:19,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:19,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:20,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:21,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:21,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:21,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:21,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:22,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:22,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:22,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:23,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:23,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:24,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:25,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:26,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:27,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:27,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:27,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:28,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:28,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:28,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:29,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:30,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:30,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:32,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:33,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:34,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:34,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:34,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:36,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:37,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:37,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:38,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:45,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:45,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:48,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:48,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:48,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:51,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:56,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:56,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:39:59,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:40:01,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:40:02,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:40:04,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:40:20,387 WARN L178 SmtUtils]: Spent 1.59 m on a formula simplification. DAG size of input: 5112 DAG size of output: 2150 [2018-10-01 00:40:21,425 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-01 00:41:55,092 WARN L178 SmtUtils]: Spent 1.56 m on a formula simplification. DAG size of input: 2150 DAG size of output: 362 [2018-10-01 00:42:02,298 WARN L178 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-01 00:42:02,304 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-10-01 00:42:02,305 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-10-01 00:42:02,305 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-10-01 00:42:02,305 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-10-01 00:42:02,305 INFO L422 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-10-01 00:42:02,305 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-10-01 00:42:02,306 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-10-01 00:42:02,339 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:42:02 BoogieIcfgContainer [2018-10-01 00:42:02,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:42:02,340 INFO L168 Benchmark]: Toolchain (without parser) took 218694.16 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 448.1 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-01 00:42:02,342 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:42:02,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:42:02,343 INFO L168 Benchmark]: Boogie Preprocessor took 20.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:42:02,343 INFO L168 Benchmark]: RCFGBuilder took 332.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:42:02,344 INFO L168 Benchmark]: TraceAbstraction took 218292.28 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 426.9 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-01 00:42:02,348 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.27 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 42.05 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 20.37 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 332.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218292.28 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 426.9 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, 218.1s OverallTime, 19 OverallIterations, 100 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 197.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 392 SDslu, 554 SDs, 0 SdLazy, 744 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s 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, 96.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 251704 FormulaSimplificationTreeSizeReductionInter, 100.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.9s 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-42-02-367.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-42-02-367.csv Received shutdown request...