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/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:52:04,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:52:04,121 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:52:04,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:52:04,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:52:04,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:52:04,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:52:04,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:52:04,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:52:04,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:52:04,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:52:04,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:52:04,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:52:04,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:52:04,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:52:04,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:52:04,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:52:04,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:52:04,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:52:04,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:52:04,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:52:04,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:52:04,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:52:04,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:52:04,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:52:04,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:52:04,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:52:04,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:52:04,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:52:04,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:52:04,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:52:04,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:52:04,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:52:04,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:52:04,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:52:04,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:52:04,190 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:52:04,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:52:04,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:52:04,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:52:04,224 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:52:04,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:52:04,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:52:04,225 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:52:04,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:52:04,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:52:04,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:52:04,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:52:04,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:52:04,227 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:52:04,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:52:04,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:52:04,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:52:04,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:52:04,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:52:04,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:52:04,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:52:04,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:52:04,229 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:52:04,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:52:04,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:52:04,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:52:04,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:52:04,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:52:04,232 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:52:04,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:52:04,232 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:52:04,232 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:52:04,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:52:04,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:52:04,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:52:04,316 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:52:04,317 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:52:04,318 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl [2018-10-01 00:52:04,318 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gr2006.c.i_4.bpl' [2018-10-01 00:52:04,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:52:04,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:52:04,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:52:04,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:52:04,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:52:04,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:52:04,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:52:04,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:52:04,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:52:04,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/1) ... [2018-10-01 00:52:04,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:52:04,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:52:04,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:52:04,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:52:04,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (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:52:04,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:52:04,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:52:04,716 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:52:04,717 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:52:04 BoogieIcfgContainer [2018-10-01 00:52:04,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:52:04,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:52:04,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:52:04,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:52:04,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:52:04" (1/2) ... [2018-10-01 00:52:04,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ead07d and model type gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:52:04, skipping insertion in model container [2018-10-01 00:52:04,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:52:04" (2/2) ... [2018-10-01 00:52:04,725 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.c.i_4.bpl [2018-10-01 00:52:04,735 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:52:04,743 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:52:04,798 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:52:04,799 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:52:04,799 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:52:04,799 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:52:04,800 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:52:04,800 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:52:04,800 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:52:04,800 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:52:04,800 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:52:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-10-01 00:52:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:52:04,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:04,827 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:52:04,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:04,836 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2018-10-01 00:52:04,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:04,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:04,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:05,074 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:52:05,078 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:52:05,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:52:05,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:52:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:52:05,103 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:05,106 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-10-01 00:52:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:05,344 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-01 00:52:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:52:05,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-01 00:52:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:05,358 INFO L225 Difference]: With dead ends: 14 [2018-10-01 00:52:05,359 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:52:05,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:52:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:52:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-01 00:52:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-01 00:52:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-10-01 00:52:05,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 5 [2018-10-01 00:52:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:05,401 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-10-01 00:52:05,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:52:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-10-01 00:52:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:52:05,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:05,402 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:52:05,402 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:05,403 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 28696809, now seen corresponding path program 1 times [2018-10-01 00:52:05,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:05,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:05,431 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:52:05,431 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:52:05,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:52:05,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:52:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:52:05,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:05,434 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 3 states. [2018-10-01 00:52:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:05,502 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2018-10-01 00:52:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:52:05,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-01 00:52:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:05,503 INFO L225 Difference]: With dead ends: 22 [2018-10-01 00:52:05,504 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:52:05,504 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:52:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:52:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-10-01 00:52:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:52:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-01 00:52:05,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2018-10-01 00:52:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:05,509 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-01 00:52:05,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:52:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-01 00:52:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:52:05,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:05,510 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-10-01 00:52:05,510 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:05,511 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1872158041, now seen corresponding path program 1 times [2018-10-01 00:52:05,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:05,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:05,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:05,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:05,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:52:05,653 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:05,654 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:52:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:05,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:52:05,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:05,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:52:05,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:52:05,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:52:05,857 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:05,857 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2018-10-01 00:52:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:06,050 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-10-01 00:52:06,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:52:06,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-01 00:52:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:06,051 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:52:06,051 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 00:52:06,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:52:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 00:52:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-01 00:52:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:52:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-10-01 00:52:06,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2018-10-01 00:52:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:06,057 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-10-01 00:52:06,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:52:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-10-01 00:52:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:52:06,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:06,058 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1] [2018-10-01 00:52:06,059 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:06,059 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:06,059 INFO L82 PathProgramCache]: Analyzing trace with hash 306486099, now seen corresponding path program 2 times [2018-10-01 00:52:06,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:06,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:06,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:06,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:52:06,120 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:06,121 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:52:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:52:06,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:52:06,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:06,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:52:06,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:06,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:52:06,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:52:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:52:06,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:06,251 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2018-10-01 00:52:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:06,529 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-01 00:52:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:52:06,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-01 00:52:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:06,530 INFO L225 Difference]: With dead ends: 28 [2018-10-01 00:52:06,530 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:52:06,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:52:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:52:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-10-01 00:52:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-01 00:52:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-10-01 00:52:06,540 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-10-01 00:52:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:06,541 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-10-01 00:52:06,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:52:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-10-01 00:52:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:52:06,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:06,542 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1] [2018-10-01 00:52:06,543 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:06,543 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:06,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1251716313, now seen corresponding path program 3 times [2018-10-01 00:52:06,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:06,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:06,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:52:06,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:06,609 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:52:06,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:06,639 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-01 00:52:06,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:06,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-01 00:52:06,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:06,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-01 00:52:06,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:52:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:52:06,826 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:06,826 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 10 states. [2018-10-01 00:52:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:07,840 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-10-01 00:52:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:52:07,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-01 00:52:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:07,842 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:52:07,842 INFO L226 Difference]: Without dead ends: 36 [2018-10-01 00:52:07,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:52:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-01 00:52:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-10-01 00:52:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:52:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-01 00:52:07,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-10-01 00:52:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:07,851 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-01 00:52:07,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:52:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-10-01 00:52:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:52:07,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:07,853 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 1, 1, 1] [2018-10-01 00:52:07,853 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:07,853 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 78979859, now seen corresponding path program 4 times [2018-10-01 00:52:07,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:07,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:07,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:07,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:07,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:52:07,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:07,967 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:52:07,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:07,990 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:07,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:07,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:52:08,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:08,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:52:08,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:52:08,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:52:08,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:08,087 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2018-10-01 00:52:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:08,228 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-10-01 00:52:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:52:08,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-01 00:52:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:08,231 INFO L225 Difference]: With dead ends: 46 [2018-10-01 00:52:08,231 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:52:08,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:52:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:52:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-10-01 00:52:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 00:52:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-01 00:52:08,240 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 26 [2018-10-01 00:52:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:08,241 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-01 00:52:08,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:52:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-01 00:52:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 00:52:08,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:08,242 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1] [2018-10-01 00:52:08,243 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:08,243 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 528202983, now seen corresponding path program 5 times [2018-10-01 00:52:08,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:08,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:08,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:08,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:08,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:52:08,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:08,415 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:52:08,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:08,458 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-01 00:52:08,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:08,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:52:08,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:08,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:52:08,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:52:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:52:08,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:08,573 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-10-01 00:52:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:08,695 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-10-01 00:52:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:52:08,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-10-01 00:52:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:08,697 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:52:08,697 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 00:52:08,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:52:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 00:52:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-01 00:52:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:52:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-01 00:52:08,706 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 29 [2018-10-01 00:52:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:08,707 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-01 00:52:08,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:52:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-01 00:52:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:52:08,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:08,708 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 4, 1, 1, 1] [2018-10-01 00:52:08,709 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:08,709 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 216195731, now seen corresponding path program 6 times [2018-10-01 00:52:08,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:08,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:08,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:52:08,926 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:08,926 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:52:08,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:52:08,962 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-01 00:52:08,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:08,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 89 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:52:09,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:09,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-01 00:52:09,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:52:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:52:09,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:09,084 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 14 states. [2018-10-01 00:52:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:09,547 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-10-01 00:52:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:52:09,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-01 00:52:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:09,549 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:52:09,549 INFO L226 Difference]: Without dead ends: 50 [2018-10-01 00:52:09,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:52:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-01 00:52:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2018-10-01 00:52:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:52:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-10-01 00:52:09,562 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 32 [2018-10-01 00:52:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:09,563 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-01 00:52:09,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:52:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-10-01 00:52:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:52:09,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:09,564 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 7, 5, 1, 1, 1] [2018-10-01 00:52:09,564 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:09,565 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1817826965, now seen corresponding path program 7 times [2018-10-01 00:52:09,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:09,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:52:09,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:09,736 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:52:09,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:09,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 99 proven. 77 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:52:09,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:09,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:52:09,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:52:09,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:52:09,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:09,884 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 10 states. [2018-10-01 00:52:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:10,079 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-10-01 00:52:10,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:52:10,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-10-01 00:52:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:10,081 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:52:10,081 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:52:10,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:52:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:52:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-01 00:52:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-01 00:52:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-10-01 00:52:10,092 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2018-10-01 00:52:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:10,093 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-10-01 00:52:10,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:52:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-10-01 00:52:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:52:10,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:10,094 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 8, 5, 1, 1, 1] [2018-10-01 00:52:10,094 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:10,095 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1636061801, now seen corresponding path program 8 times [2018-10-01 00:52:10,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:10,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:52:10,249 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:10,249 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:52:10,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:52:10,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:52:10,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:10,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 112 proven. 100 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:52:10,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:10,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:52:10,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:52:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:52:10,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:10,491 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 11 states. [2018-10-01 00:52:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:10,826 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-10-01 00:52:10,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:52:10,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-10-01 00:52:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:10,827 INFO L225 Difference]: With dead ends: 64 [2018-10-01 00:52:10,827 INFO L226 Difference]: Without dead ends: 46 [2018-10-01 00:52:10,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:52:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-01 00:52:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-01 00:52:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:52:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-10-01 00:52:10,842 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 41 [2018-10-01 00:52:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:10,843 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-10-01 00:52:10,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:52:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-10-01 00:52:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:52:10,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:10,844 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 9, 5, 1, 1, 1] [2018-10-01 00:52:10,845 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:10,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1671145963, now seen corresponding path program 9 times [2018-10-01 00:52:10,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:10,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:10,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:10,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 125 proven. 126 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-01 00:52:11,199 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:11,199 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:52:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:11,269 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-10-01 00:52:11,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:11,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 203 proven. 57 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-01 00:52:11,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:11,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-01 00:52:11,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:52:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:52:11,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:11,699 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 22 states. [2018-10-01 00:52:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:13,168 INFO L93 Difference]: Finished difference Result 147 states and 188 transitions. [2018-10-01 00:52:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:52:13,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-10-01 00:52:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:13,170 INFO L225 Difference]: With dead ends: 147 [2018-10-01 00:52:13,170 INFO L226 Difference]: Without dead ends: 129 [2018-10-01 00:52:13,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:52:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-01 00:52:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 63. [2018-10-01 00:52:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:52:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-10-01 00:52:13,195 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 44 [2018-10-01 00:52:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:13,196 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-10-01 00:52:13,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:52:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-10-01 00:52:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:52:13,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:13,197 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 10, 10, 1, 1, 1] [2018-10-01 00:52:13,197 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:13,197 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -439985581, now seen corresponding path program 10 times [2018-10-01 00:52:13,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:13,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:13,588 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:13,588 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:52:13,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:13,659 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:13,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:13,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 298 proven. 155 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:13,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:13,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:52:13,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:52:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:52:13,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:13,934 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 13 states. [2018-10-01 00:52:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:14,357 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2018-10-01 00:52:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:52:14,358 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-10-01 00:52:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:14,359 INFO L225 Difference]: With dead ends: 100 [2018-10-01 00:52:14,359 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:52:14,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:52:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:52:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-01 00:52:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-01 00:52:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-10-01 00:52:14,380 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 62 [2018-10-01 00:52:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:14,380 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-10-01 00:52:14,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:52:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-10-01 00:52:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 00:52:14,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:14,381 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 11, 10, 1, 1, 1] [2018-10-01 00:52:14,382 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:14,382 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 703568423, now seen corresponding path program 11 times [2018-10-01 00:52:14,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:14,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:14,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:14,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:14,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:14,745 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:52:14,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:14,793 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-10-01 00:52:14,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:14,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 326 proven. 187 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:14,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:14,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:52:14,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:52:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:52:14,909 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:14,909 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 14 states. [2018-10-01 00:52:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:15,149 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2018-10-01 00:52:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:52:15,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-10-01 00:52:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:15,151 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:52:15,151 INFO L226 Difference]: Without dead ends: 70 [2018-10-01 00:52:15,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:52:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-01 00:52:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-01 00:52:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:52:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-10-01 00:52:15,171 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 65 [2018-10-01 00:52:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:15,171 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-10-01 00:52:15,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:52:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-10-01 00:52:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:52:15,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:15,172 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 12, 10, 1, 1, 1] [2018-10-01 00:52:15,173 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:15,173 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash 640309715, now seen corresponding path program 12 times [2018-10-01 00:52:15,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:15,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:15,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:15,294 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:15,294 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:52:15,310 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:52:15,346 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-10-01 00:52:15,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:15,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 354 proven. 222 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:15,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:15,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:52:15,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:52:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:52:15,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:15,485 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 15 states. [2018-10-01 00:52:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:15,694 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2018-10-01 00:52:15,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:52:15,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-10-01 00:52:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:15,696 INFO L225 Difference]: With dead ends: 106 [2018-10-01 00:52:15,696 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:52:15,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:52:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:52:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-01 00:52:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-01 00:52:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-10-01 00:52:15,716 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 68 [2018-10-01 00:52:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:15,716 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-10-01 00:52:15,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:52:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-10-01 00:52:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-01 00:52:15,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:15,718 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 13, 10, 1, 1, 1] [2018-10-01 00:52:15,718 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:15,718 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1590782631, now seen corresponding path program 13 times [2018-10-01 00:52:15,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:15,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:15,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:15,986 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:15,986 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:52:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:16,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 382 proven. 260 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:16,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:16,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:52:16,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:52:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:52:16,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:16,161 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 16 states. [2018-10-01 00:52:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:16,460 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2018-10-01 00:52:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:52:16,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-10-01 00:52:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:16,461 INFO L225 Difference]: With dead ends: 109 [2018-10-01 00:52:16,462 INFO L226 Difference]: Without dead ends: 76 [2018-10-01 00:52:16,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:52:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-01 00:52:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-01 00:52:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:52:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-10-01 00:52:16,478 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 71 [2018-10-01 00:52:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:16,478 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-10-01 00:52:16,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:52:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-10-01 00:52:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:52:16,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:16,480 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 14, 10, 1, 1, 1] [2018-10-01 00:52:16,480 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:16,480 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 410040659, now seen corresponding path program 14 times [2018-10-01 00:52:16,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:16,781 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:16,781 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:52:16,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:52:16,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:52:16,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:16,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 410 proven. 301 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:16,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:16,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:52:16,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:52:16,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:52:16,986 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:16,986 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 17 states. [2018-10-01 00:52:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:17,201 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2018-10-01 00:52:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:52:17,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-10-01 00:52:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:17,202 INFO L225 Difference]: With dead ends: 112 [2018-10-01 00:52:17,202 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:52:17,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:52:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:52:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-01 00:52:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-01 00:52:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-10-01 00:52:17,224 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 74 [2018-10-01 00:52:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:17,224 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-10-01 00:52:17,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:52:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-10-01 00:52:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 00:52:17,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:17,226 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 15, 10, 1, 1, 1] [2018-10-01 00:52:17,226 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:17,226 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash 708107047, now seen corresponding path program 15 times [2018-10-01 00:52:17,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:17,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:17,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 438 proven. 345 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:17,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:17,506 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:52:17,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:17,591 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-10-01 00:52:17,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:17,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 438 proven. 345 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:17,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:17,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:52:17,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:52:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:52:17,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:17,739 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 18 states. [2018-10-01 00:52:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:17,958 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2018-10-01 00:52:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:52:17,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-10-01 00:52:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:17,961 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:52:17,961 INFO L226 Difference]: Without dead ends: 82 [2018-10-01 00:52:17,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:52:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-01 00:52:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-01 00:52:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 00:52:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-10-01 00:52:17,977 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 77 [2018-10-01 00:52:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:17,977 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-10-01 00:52:17,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:52:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-10-01 00:52:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 00:52:17,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:17,978 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 16, 10, 1, 1, 1] [2018-10-01 00:52:17,979 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:17,979 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:17,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1588496173, now seen corresponding path program 16 times [2018-10-01 00:52:17,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:17,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:17,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:17,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 466 proven. 392 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:18,204 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:18,204 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:52:18,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:18,234 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:18,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:18,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 466 proven. 392 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:18,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:18,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:52:18,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:52:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:52:18,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:18,389 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 19 states. [2018-10-01 00:52:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:18,609 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2018-10-01 00:52:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:52:18,609 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-10-01 00:52:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:18,610 INFO L225 Difference]: With dead ends: 118 [2018-10-01 00:52:18,611 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:52:18,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:52:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:52:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-01 00:52:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-01 00:52:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-10-01 00:52:18,627 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 80 [2018-10-01 00:52:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:18,627 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-10-01 00:52:18,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:52:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-10-01 00:52:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-01 00:52:18,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:18,628 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 17, 10, 1, 1, 1] [2018-10-01 00:52:18,629 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:18,629 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash -865997913, now seen corresponding path program 17 times [2018-10-01 00:52:18,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:18,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:18,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 494 proven. 442 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:18,804 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:18,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:18,813 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:18,915 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-10-01 00:52:18,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:18,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 494 proven. 442 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:19,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:19,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:52:19,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:52:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:52:19,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:19,046 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 20 states. [2018-10-01 00:52:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:19,330 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2018-10-01 00:52:19,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:52:19,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-10-01 00:52:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:19,331 INFO L225 Difference]: With dead ends: 121 [2018-10-01 00:52:19,331 INFO L226 Difference]: Without dead ends: 88 [2018-10-01 00:52:19,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:52:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-01 00:52:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-01 00:52:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:52:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-10-01 00:52:19,348 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 83 [2018-10-01 00:52:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:19,349 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-10-01 00:52:19,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:52:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-10-01 00:52:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:52:19,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:19,350 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 18, 10, 1, 1, 1] [2018-10-01 00:52:19,350 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:19,350 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:19,350 INFO L82 PathProgramCache]: Analyzing trace with hash 998545491, now seen corresponding path program 18 times [2018-10-01 00:52:19,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:19,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:19,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:19,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:19,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 522 proven. 495 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-10-01 00:52:19,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:19,693 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:52:19,749 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-01 00:52:19,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:19,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 814 proven. 262 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-10-01 00:52:19,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:19,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 35 [2018-10-01 00:52:20,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:52:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:52:20,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:20,000 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 35 states. [2018-10-01 00:52:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:22,300 INFO L93 Difference]: Finished difference Result 248 states and 313 transitions. [2018-10-01 00:52:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:52:22,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 86 [2018-10-01 00:52:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:22,302 INFO L225 Difference]: With dead ends: 248 [2018-10-01 00:52:22,302 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:52:22,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:52:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:52:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 102. [2018-10-01 00:52:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-01 00:52:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-10-01 00:52:22,334 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 86 [2018-10-01 00:52:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:22,335 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-10-01 00:52:22,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:52:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-10-01 00:52:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-01 00:52:22,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:22,336 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 19, 14, 1, 1, 1] [2018-10-01 00:52:22,336 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:22,337 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1184031065, now seen corresponding path program 19 times [2018-10-01 00:52:22,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:22,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:22,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 786 proven. 551 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-01 00:52:22,554 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:22,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:22,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:22,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 786 proven. 551 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-01 00:52:22,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:22,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:52:22,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:52:22,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:52:22,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:22,743 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 22 states. [2018-10-01 00:52:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:23,020 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2018-10-01 00:52:23,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:52:23,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2018-10-01 00:52:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:23,021 INFO L225 Difference]: With dead ends: 151 [2018-10-01 00:52:23,022 INFO L226 Difference]: Without dead ends: 106 [2018-10-01 00:52:23,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:52:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-01 00:52:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-01 00:52:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-01 00:52:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-10-01 00:52:23,049 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 101 [2018-10-01 00:52:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:23,049 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-10-01 00:52:23,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:52:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-10-01 00:52:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 00:52:23,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:23,050 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 20, 14, 1, 1, 1] [2018-10-01 00:52:23,050 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:23,051 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 204896339, now seen corresponding path program 20 times [2018-10-01 00:52:23,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:23,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 826 proven. 610 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-01 00:52:23,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:23,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:23,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:52:23,906 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:52:23,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:23,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 826 proven. 610 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-01 00:52:24,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:24,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:52:24,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:52:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:52:24,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:24,076 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 23 states. [2018-10-01 00:52:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:24,334 INFO L93 Difference]: Finished difference Result 154 states and 183 transitions. [2018-10-01 00:52:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:52:24,337 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 104 [2018-10-01 00:52:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:24,338 INFO L225 Difference]: With dead ends: 154 [2018-10-01 00:52:24,338 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:52:24,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:52:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:52:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-01 00:52:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-01 00:52:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-10-01 00:52:24,366 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 104 [2018-10-01 00:52:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:24,366 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-10-01 00:52:24,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:52:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-10-01 00:52:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-01 00:52:24,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:24,366 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 21, 14, 1, 1, 1] [2018-10-01 00:52:24,367 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:24,367 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 26259239, now seen corresponding path program 21 times [2018-10-01 00:52:24,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:24,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:24,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 866 proven. 672 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-01 00:52:25,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:25,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:25,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:25,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-01 00:52:25,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:25,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1211 proven. 534 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-01 00:52:26,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:26,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-01 00:52:26,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:52:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:52:26,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:26,344 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 46 states. [2018-10-01 00:52:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:30,249 INFO L93 Difference]: Finished difference Result 501 states and 650 transitions. [2018-10-01 00:52:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:52:30,249 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 107 [2018-10-01 00:52:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:30,251 INFO L225 Difference]: With dead ends: 501 [2018-10-01 00:52:30,251 INFO L226 Difference]: Without dead ends: 456 [2018-10-01 00:52:30,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time [2018-10-01 00:52:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-01 00:52:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 135. [2018-10-01 00:52:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-01 00:52:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-10-01 00:52:30,329 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 107 [2018-10-01 00:52:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:30,329 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-10-01 00:52:30,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:52:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-10-01 00:52:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-01 00:52:30,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:30,330 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 22, 22, 1, 1, 1] [2018-10-01 00:52:30,331 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:30,331 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1522473171, now seen corresponding path program 22 times [2018-10-01 00:52:30,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:30,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:30,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:30,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:30,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1450 proven. 737 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:30,511 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:30,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:30,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:30,563 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:30,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:30,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 43 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:30,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:30,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 45] total 45 [2018-10-01 00:52:30,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:52:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:52:30,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:30,969 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 46 states. [2018-10-01 00:52:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:31,426 INFO L93 Difference]: Finished difference Result 271 states and 337 transitions. [2018-10-01 00:52:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:52:31,426 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 134 [2018-10-01 00:52:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:31,427 INFO L225 Difference]: With dead ends: 271 [2018-10-01 00:52:31,427 INFO L226 Difference]: Without dead ends: 202 [2018-10-01 00:52:31,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:52:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-01 00:52:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-01 00:52:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-01 00:52:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2018-10-01 00:52:31,508 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 134 [2018-10-01 00:52:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:31,508 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2018-10-01 00:52:31,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:52:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2018-10-01 00:52:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-01 00:52:31,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:31,509 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 44, 22, 1, 1, 1] [2018-10-01 00:52:31,510 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:31,510 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1238420653, now seen corresponding path program 23 times [2018-10-01 00:52:31,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:31,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:31,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2858 proven. 2926 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:32,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:32,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:32,840 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:52:32,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:32,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2858 proven. 2926 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:33,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:33,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 00:52:33,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:52:33,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:52:33,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:33,256 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand 47 states. [2018-10-01 00:52:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:33,987 INFO L93 Difference]: Finished difference Result 274 states and 319 transitions. [2018-10-01 00:52:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:52:33,988 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 200 [2018-10-01 00:52:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:33,990 INFO L225 Difference]: With dead ends: 274 [2018-10-01 00:52:33,990 INFO L226 Difference]: Without dead ends: 205 [2018-10-01 00:52:33,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:52:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-01 00:52:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-10-01 00:52:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-01 00:52:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 226 transitions. [2018-10-01 00:52:34,077 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 226 transitions. Word has length 200 [2018-10-01 00:52:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:34,078 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 226 transitions. [2018-10-01 00:52:34,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:52:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 226 transitions. [2018-10-01 00:52:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-01 00:52:34,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:34,079 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 45, 22, 1, 1, 1] [2018-10-01 00:52:34,079 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:34,079 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash 473463335, now seen corresponding path program 24 times [2018-10-01 00:52:34,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:34,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:34,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 2922 proven. 3060 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:34,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:34,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:34,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:52:34,749 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:52:34,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:34,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 2922 proven. 3060 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:35,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:35,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 00:52:35,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:52:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:52:35,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:35,053 INFO L87 Difference]: Start difference. First operand 204 states and 226 transitions. Second operand 48 states. [2018-10-01 00:52:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:35,700 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-10-01 00:52:35,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:52:35,701 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 203 [2018-10-01 00:52:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:35,703 INFO L225 Difference]: With dead ends: 277 [2018-10-01 00:52:35,703 INFO L226 Difference]: Without dead ends: 208 [2018-10-01 00:52:35,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:52:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-01 00:52:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-10-01 00:52:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:52:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2018-10-01 00:52:35,788 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 203 [2018-10-01 00:52:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:35,789 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2018-10-01 00:52:35,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:52:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2018-10-01 00:52:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-01 00:52:35,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:35,790 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 46, 22, 1, 1, 1] [2018-10-01 00:52:35,790 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:35,790 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 767677139, now seen corresponding path program 25 times [2018-10-01 00:52:35,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:35,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:35,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 2986 proven. 3197 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:36,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:36,387 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:36,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:36,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 2986 proven. 3197 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:36,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:36,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-01 00:52:36,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 00:52:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 00:52:36,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:36,732 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand 49 states. [2018-10-01 00:52:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:38,195 INFO L93 Difference]: Finished difference Result 280 states and 325 transitions. [2018-10-01 00:52:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:52:38,195 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 206 [2018-10-01 00:52:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:38,197 INFO L225 Difference]: With dead ends: 280 [2018-10-01 00:52:38,197 INFO L226 Difference]: Without dead ends: 211 [2018-10-01 00:52:38,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:52:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-01 00:52:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-10-01 00:52:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-01 00:52:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2018-10-01 00:52:38,301 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 206 [2018-10-01 00:52:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:38,301 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2018-10-01 00:52:38,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 00:52:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2018-10-01 00:52:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-01 00:52:38,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:38,303 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 47, 22, 1, 1, 1] [2018-10-01 00:52:38,303 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:38,304 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash -337139033, now seen corresponding path program 26 times [2018-10-01 00:52:38,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:38,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3050 proven. 3337 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:39,107 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:39,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:39,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:52:39,184 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:52:39,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:39,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 3050 proven. 3337 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:39,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:39,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-01 00:52:39,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:52:39,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:52:39,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:39,555 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand 50 states. [2018-10-01 00:52:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:40,124 INFO L93 Difference]: Finished difference Result 283 states and 328 transitions. [2018-10-01 00:52:40,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:52:40,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 209 [2018-10-01 00:52:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:40,127 INFO L225 Difference]: With dead ends: 283 [2018-10-01 00:52:40,127 INFO L226 Difference]: Without dead ends: 214 [2018-10-01 00:52:40,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:52:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-01 00:52:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-01 00:52:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:52:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 235 transitions. [2018-10-01 00:52:40,254 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 235 transitions. Word has length 209 [2018-10-01 00:52:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:40,254 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 235 transitions. [2018-10-01 00:52:40,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:52:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 235 transitions. [2018-10-01 00:52:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-01 00:52:40,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:40,256 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 48, 22, 1, 1, 1] [2018-10-01 00:52:40,256 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:40,256 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1581329837, now seen corresponding path program 27 times [2018-10-01 00:52:40,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:40,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:40,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:40,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 3114 proven. 3480 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-10-01 00:52:41,016 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:41,017 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:41,181 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-10-01 00:52:41,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:41,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 4841 proven. 1366 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2018-10-01 00:52:42,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:42,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 25] total 74 [2018-10-01 00:52:42,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:52:42,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:52:42,734 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:42,734 INFO L87 Difference]: Start difference. First operand 213 states and 235 transitions. Second operand 74 states. [2018-10-01 00:52:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:47,937 INFO L93 Difference]: Finished difference Result 353 states and 421 transitions. [2018-10-01 00:52:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:52:47,938 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 212 [2018-10-01 00:52:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:47,939 INFO L225 Difference]: With dead ends: 353 [2018-10-01 00:52:47,940 INFO L226 Difference]: Without dead ends: 284 [2018-10-01 00:52:47,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time [2018-10-01 00:52:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-01 00:52:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 219. [2018-10-01 00:52:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-01 00:52:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 242 transitions. [2018-10-01 00:52:48,041 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 242 transitions. Word has length 212 [2018-10-01 00:52:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:48,042 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 242 transitions. [2018-10-01 00:52:48,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:52:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 242 transitions. [2018-10-01 00:52:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-01 00:52:48,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:48,043 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 49, 23, 1, 1, 1] [2018-10-01 00:52:48,043 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:48,044 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash -746499883, now seen corresponding path program 28 times [2018-10-01 00:52:48,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:48,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:48,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:48,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:48,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3327 proven. 3626 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-01 00:52:48,596 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:48,596 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:48,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:48,693 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:48,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:48,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 3327 proven. 3626 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-01 00:52:49,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:49,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 00:52:49,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:52:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:52:49,005 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:49,005 INFO L87 Difference]: Start difference. First operand 219 states and 242 transitions. Second operand 52 states. [2018-10-01 00:52:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:49,807 INFO L93 Difference]: Finished difference Result 315 states and 362 transitions. [2018-10-01 00:52:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:52:49,808 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 218 [2018-10-01 00:52:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:49,810 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:52:49,810 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:52:49,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:52:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:52:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 222. [2018-10-01 00:52:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-01 00:52:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2018-10-01 00:52:49,909 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 218 [2018-10-01 00:52:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:49,910 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2018-10-01 00:52:49,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:52:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2018-10-01 00:52:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-01 00:52:49,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:49,911 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 50, 23, 1, 1, 1] [2018-10-01 00:52:49,912 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:49,912 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:49,912 INFO L82 PathProgramCache]: Analyzing trace with hash 287181481, now seen corresponding path program 29 times [2018-10-01 00:52:49,912 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:49,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 6320 proven. 1497 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-01 00:52:50,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:50,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:50,747 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2018-10-01 00:52:50,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:50,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 6320 proven. 1497 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-01 00:52:51,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:51,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 00:52:51,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:52:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:52:51,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:51,727 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand 53 states. [2018-10-01 00:52:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:58,315 INFO L93 Difference]: Finished difference Result 2184 states and 2878 transitions. [2018-10-01 00:52:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:52:58,316 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 221 [2018-10-01 00:52:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:58,330 INFO L225 Difference]: With dead ends: 2184 [2018-10-01 00:52:58,330 INFO L226 Difference]: Without dead ends: 2182 [2018-10-01 00:52:58,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:52:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-10-01 00:52:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 306. [2018-10-01 00:52:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-01 00:52:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 357 transitions. [2018-10-01 00:52:58,813 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 357 transitions. Word has length 221 [2018-10-01 00:52:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:58,814 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 357 transitions. [2018-10-01 00:52:58,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:52:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 357 transitions. [2018-10-01 00:52:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-01 00:52:58,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:58,816 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1] [2018-10-01 00:52:58,817 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:58,817 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1270384855, now seen corresponding path program 30 times [2018-10-01 00:52:58,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:58,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:58,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-10-01 00:53:01,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:01,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:01,583 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:53:01,868 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2018-10-01 00:53:01,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:01,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:07,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:07,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 102] total 105 [2018-10-01 00:53:07,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 00:53:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 00:53:07,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:07,527 INFO L87 Difference]: Start difference. First operand 306 states and 357 transitions. Second operand 105 states. [2018-10-01 00:54:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:25,757 INFO L93 Difference]: Finished difference Result 4437 states and 5816 transitions. [2018-10-01 00:54:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-01 00:54:25,757 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 305 [2018-10-01 00:54:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:25,774 INFO L225 Difference]: With dead ends: 4437 [2018-10-01 00:54:25,774 INFO L226 Difference]: Without dead ends: 4281 [2018-10-01 00:54:25,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s Time [2018-10-01 00:54:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2018-10-01 00:54:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4183. [2018-10-01 00:54:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2018-10-01 00:54:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 4283 transitions. [2018-10-01 00:54:35,124 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 4283 transitions. Word has length 305 [2018-10-01 00:54:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:35,124 INFO L480 AbstractCegarLoop]: Abstraction has 4183 states and 4283 transitions. [2018-10-01 00:54:35,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 00:54:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 4283 transitions. [2018-10-01 00:54:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-01 00:54:35,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:35,127 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1] [2018-10-01 00:54:35,127 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:35,127 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1218035091, now seen corresponding path program 31 times [2018-10-01 00:54:35,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:35,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:35,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-01 00:54:37,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:37,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:37,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-01 00:54:37,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:37,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-01 00:54:37,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:54:37,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:54:37,722 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:37,723 INFO L87 Difference]: Start difference. First operand 4183 states and 4283 transitions. Second operand 54 states. [2018-10-01 00:54:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:40,977 INFO L93 Difference]: Finished difference Result 4334 states and 4434 transitions. [2018-10-01 00:54:40,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:54:40,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 308 [2018-10-01 00:54:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:40,978 INFO L225 Difference]: With dead ends: 4334 [2018-10-01 00:54:40,978 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:54:40,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:54:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:54:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:54:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:54:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:54:40,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 308 [2018-10-01 00:54:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:40,985 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:54:40,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:54:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:54:40,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:54:40,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:54:45,346 WARN L178 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 1522 DAG size of output: 1181 [2018-10-01 00:54:45,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:45,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:45,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:49,747 WARN L178 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 1629 DAG size of output: 1053 [2018-10-01 00:54:52,801 WARN L178 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 1522 DAG size of output: 1181 [2018-10-01 00:55:05,342 WARN L178 SmtUtils]: Spent 12.53 s on a formula simplification. DAG size of input: 1173 DAG size of output: 459 [2018-10-01 00:55:16,977 WARN L178 SmtUtils]: Spent 11.60 s on a formula simplification. DAG size of input: 1053 DAG size of output: 461 [2018-10-01 00:55:27,998 WARN L178 SmtUtils]: Spent 11.01 s on a formula simplification. DAG size of input: 1173 DAG size of output: 459 [2018-10-01 00:55:28,002 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 55) no Hoare annotation was computed. [2018-10-01 00:55:28,002 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 54) no Hoare annotation was computed. [2018-10-01 00:55:28,003 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 55) no Hoare annotation was computed. [2018-10-01 00:55:28,003 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 55) no Hoare annotation was computed. [2018-10-01 00:55:28,004 INFO L422 ceAbstractionStarter]: At program point L22(lines 22 31) the Hoare annotation is: (let ((.cse7 (<= ULTIMATE.start_main_~y~4 11)) (.cse6 (<= 11 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 44)) (.cse3 (<= 44 ULTIMATE.start_main_~y~4)) (.cse11 (<= 2 ULTIMATE.start_main_~y~4)) (.cse10 (<= ULTIMATE.start_main_~y~4 2)) (.cse26 (<= ULTIMATE.start_main_~y~4 7)) (.cse27 (<= 7 ULTIMATE.start_main_~y~4)) (.cse12 (<= ULTIMATE.start_main_~y~4 22)) (.cse13 (<= 22 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 6)) (.cse38 (<= 6 ULTIMATE.start_main_~y~4)) (.cse58 (<= ULTIMATE.start_main_~y~4 28)) (.cse59 (<= 28 ULTIMATE.start_main_~y~4)) (.cse54 (<= 49 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 49)) (.cse37 (<= 19 ULTIMATE.start_main_~y~4)) (.cse36 (<= ULTIMATE.start_main_~y~4 19)) (.cse42 (<= 20 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 20)) (.cse60 (<= 25 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 25)) (.cse18 (<= 16 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 16)) (.cse67 (<= 9 ULTIMATE.start_main_~y~4)) (.cse66 (<= ULTIMATE.start_main_~y~4 9)) (.cse32 (<= ULTIMATE.start_main_~y~4 30)) (.cse33 (<= 30 ULTIMATE.start_main_~y~4)) (.cse28 (<= 32 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 32)) (.cse4 (<= 35 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 35)) (.cse65 (<= 13 ULTIMATE.start_main_~y~4)) (.cse64 (<= ULTIMATE.start_main_~y~4 13)) (.cse69 (<= 24 ULTIMATE.start_main_~y~4)) (.cse68 (<= ULTIMATE.start_main_~y~4 24)) (.cse40 (<= 4 ULTIMATE.start_main_~y~4)) (.cse41 (<= ULTIMATE.start_main_~y~4 4)) (.cse20 (<= 21 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 21)) (.cse75 (<= ULTIMATE.start_main_~y~4 5)) (.cse74 (<= 5 ULTIMATE.start_main_~y~4)) (.cse23 (<= ULTIMATE.start_main_~y~4 37)) (.cse22 (<= 37 ULTIMATE.start_main_~y~4)) (.cse46 (<= 17 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 17)) (.cse81 (<= 36 ULTIMATE.start_main_~y~4)) (.cse80 (<= ULTIMATE.start_main_~y~4 36)) (.cse31 (<= 40 ULTIMATE.start_main_~y~4)) (.cse30 (<= ULTIMATE.start_main_~y~4 40)) (.cse70 (<= 8 ULTIMATE.start_main_~y~4)) (.cse71 (<= ULTIMATE.start_main_~y~4 8)) (.cse76 (<= ULTIMATE.start_main_~y~4 46)) (.cse77 (<= 46 ULTIMATE.start_main_~y~4)) (.cse48 (<= 45 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 45)) (.cse35 (<= ULTIMATE.start_main_~y~4 26)) (.cse34 (<= 26 ULTIMATE.start_main_~y~4)) (.cse44 (<= 14 ULTIMATE.start_main_~y~4)) (.cse45 (<= ULTIMATE.start_main_~y~4 14)) (.cse56 (<= 31 ULTIMATE.start_main_~y~4)) (.cse57 (<= ULTIMATE.start_main_~y~4 31)) (.cse88 (<= ULTIMATE.start_main_~y~4 27)) (.cse89 (<= 27 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 3)) (.cse17 (<= 3 ULTIMATE.start_main_~y~4)) (.cse14 (<= 43 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 43)) (.cse53 (<= ULTIMATE.start_main_~y~4 23)) (.cse52 (<= 23 ULTIMATE.start_main_~y~4)) (.cse82 (<= ULTIMATE.start_main_~y~4 10)) (.cse83 (<= 10 ULTIMATE.start_main_~y~4)) (.cse78 (<= ULTIMATE.start_main_~y~4 15)) (.cse79 (<= 15 ULTIMATE.start_main_~y~4)) (.cse72 (<= 39 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 39)) (.cse94 (<= ULTIMATE.start_main_~y~4 1)) (.cse95 (<= 1 ULTIMATE.start_main_~y~4)) (.cse87 (<= 38 ULTIMATE.start_main_~y~4)) (.cse86 (<= ULTIMATE.start_main_~y~4 38)) (.cse63 (<= ULTIMATE.start_main_~y~4 41)) (.cse62 (<= 41 ULTIMATE.start_main_~y~4)) (.cse90 (<= 47 ULTIMATE.start_main_~y~4)) (.cse91 (<= ULTIMATE.start_main_~y~4 47)) (.cse8 (<= ULTIMATE.start_main_~y~4 34)) (.cse9 (<= 34 ULTIMATE.start_main_~y~4)) (.cse98 (<= ULTIMATE.start_main_~y~4 0)) (.cse99 (<= 0 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 42)) (.cse84 (<= 42 ULTIMATE.start_main_~y~4)) (.cse51 (<= ULTIMATE.start_main_~y~4 18)) (.cse50 (<= 18 ULTIMATE.start_main_~y~4)) (.cse92 (<= 48 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 48)) (.cse96 (<= ULTIMATE.start_main_~y~4 29)) (.cse97 (<= 29 ULTIMATE.start_main_~y~4)) (.cse0 (<= 33 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 33)) (.cse24 (<= 12 ULTIMATE.start_main_~y~4)) (.cse25 (<= ULTIMATE.start_main_~y~4 12))) (or (and .cse0 (= ULTIMATE.start_main_~x~4 33) .cse1) (and .cse2 .cse3 (= ULTIMATE.start_main_~x~4 44)) (and .cse4 .cse5 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse6 .cse7) (and .cse7 .cse6 (= ULTIMATE.start_main_~x~4 11)) (and (= ULTIMATE.start_main_~x~4 34) .cse8 .cse9) (and .cse10 (= ULTIMATE.start_main_~x~4 2) .cse11) (and .cse12 (= ULTIMATE.start_main_~x~4 22) .cse13) (and .cse14 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse15) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse2 .cse3) (and .cse16 .cse17 (= ULTIMATE.start_main_~x~4 3)) (and (= ULTIMATE.start_main_~x~4 16) .cse18 .cse19) (and (= ULTIMATE.start_main_~x~4 21) .cse20 .cse21) (and .cse22 .cse23 (= ULTIMATE.start_main_~x~4 37)) (and (= ULTIMATE.start_main_~x~4 12) .cse24 .cse25) (and .cse11 (<= ULTIMATE.start_main_~x~4 98) .cse10 (<= 98 ULTIMATE.start_main_~x~4)) (and .cse26 .cse27 (= ULTIMATE.start_main_~x~4 7)) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and .cse30 .cse31 (= ULTIMATE.start_main_~x~4 40)) (and (= ULTIMATE.start_main_~x~4 30) .cse32 .cse33) (and .cse34 (<= 74 ULTIMATE.start_main_~x~4) .cse35 (<= ULTIMATE.start_main_~x~4 74)) (and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse36 .cse37) (and (= ULTIMATE.start_main_~x~4 6) .cse38 .cse39) (and .cse40 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse41) (and .cse26 (<= ULTIMATE.start_main_~x~4 93) .cse27 (<= 93 ULTIMATE.start_main_~x~4)) (and .cse12 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4) .cse13) (and (= ULTIMATE.start_main_~x~4 20) .cse42 .cse43) (and .cse44 (= ULTIMATE.start_main_~x~4 14) .cse45) (and .cse39 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4) .cse38) (and (<= 83 ULTIMATE.start_main_~x~4) .cse46 .cse47 (<= ULTIMATE.start_main_~x~4 83)) (and .cse48 (= ULTIMATE.start_main_~x~4 45) .cse49) (and .cse50 .cse51 (= ULTIMATE.start_main_~x~4 18)) (and (<= ULTIMATE.start_main_~x~4 77) .cse52 (<= 77 ULTIMATE.start_main_~x~4) .cse53) (and (<= 51 ULTIMATE.start_main_~x~4) .cse54 .cse55 (<= ULTIMATE.start_main_~x~4 51)) (and .cse56 (= ULTIMATE.start_main_~x~4 31) .cse57) (and .cse58 (= ULTIMATE.start_main_~x~4 28) .cse59) (and .cse60 (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse61) (and (<= 72 ULTIMATE.start_main_~x~4) .cse58 (<= ULTIMATE.start_main_~x~4 72) .cse59) (and (= ULTIMATE.start_main_~x~4 49) .cse54 .cse55) (and (<= ULTIMATE.start_main_~x~4 59) .cse62 .cse63 (<= 59 ULTIMATE.start_main_~x~4)) (and .cse37 .cse36 (= ULTIMATE.start_main_~x~4 19)) (and .cse42 (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4) .cse43) (and .cse64 .cse65 (= ULTIMATE.start_main_~x~4 13)) (and .cse60 .cse61 (= ULTIMATE.start_main_~x~4 25)) (and (= ULTIMATE.start_main_~x~4 9) .cse66 .cse67) (and (<= ULTIMATE.start_main_~x~4 76) .cse68 (<= 76 ULTIMATE.start_main_~x~4) .cse69) (and .cse18 (<= ULTIMATE.start_main_~x~4 84) .cse19 (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) .cse70 .cse71 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse67 (<= ULTIMATE.start_main_~x~4 91) .cse66 (<= 91 ULTIMATE.start_main_~x~4)) (and .cse32 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse33) (and .cse28 (= ULTIMATE.start_main_~x~4 32) .cse29) (and (= ULTIMATE.start_main_~x~4 35) .cse4 .cse5) (and .cse65 .cse64 (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and .cse72 .cse73 (= ULTIMATE.start_main_~x~4 39)) (and .cse69 .cse68 (= ULTIMATE.start_main_~x~4 24)) (and .cse40 (= ULTIMATE.start_main_~x~4 4) .cse41) (and (<= 79 ULTIMATE.start_main_~x~4) .cse20 (<= ULTIMATE.start_main_~x~4 79) .cse21) (and .cse74 .cse75 (= ULTIMATE.start_main_~x~4 5)) (and (<= ULTIMATE.start_main_~x~4 54) .cse76 (<= 54 ULTIMATE.start_main_~x~4) .cse77) (and .cse78 (= ULTIMATE.start_main_~x~4 15) .cse79) (and .cse75 (<= 95 ULTIMATE.start_main_~x~4) .cse74 (<= ULTIMATE.start_main_~x~4 95)) (and (<= 63 ULTIMATE.start_main_~x~4) .cse23 (<= ULTIMATE.start_main_~x~4 63) .cse22) (and (= ULTIMATE.start_main_~x~4 36) .cse80 .cse81) (and (= ULTIMATE.start_main_~x~4 17) .cse46 .cse47) (and .cse82 (<= ULTIMATE.start_main_~x~4 90) .cse83 (<= 90 ULTIMATE.start_main_~x~4)) (and .cse81 (<= ULTIMATE.start_main_~x~4 64) .cse80 (<= 64 ULTIMATE.start_main_~x~4)) (and .cse31 (<= 60 ULTIMATE.start_main_~x~4) .cse30 (<= ULTIMATE.start_main_~x~4 60)) (and .cse70 .cse71 (= ULTIMATE.start_main_~x~4 8)) (and .cse84 (<= 58 ULTIMATE.start_main_~x~4) .cse85 (<= ULTIMATE.start_main_~x~4 58)) (and .cse86 (= ULTIMATE.start_main_~x~4 38) .cse87) (and (= ULTIMATE.start_main_~x~4 46) .cse76 .cse77) (and .cse88 .cse89 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and (= ULTIMATE.start_main_~x~4 47) .cse90 .cse91) (and .cse92 (= ULTIMATE.start_main_~x~4 48) .cse93) (and .cse48 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse49) (and (= ULTIMATE.start_main_~x~4 26) .cse35 .cse34) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse94 .cse95) (and .cse44 (<= 86 ULTIMATE.start_main_~x~4) .cse45 (<= ULTIMATE.start_main_~x~4 86)) (and (= ULTIMATE.start_main_~x~4 29) .cse96 .cse97) (and .cse56 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) .cse57) (and .cse88 (= ULTIMATE.start_main_~x~4 27) .cse89) (and .cse16 (<= 97 ULTIMATE.start_main_~x~4) .cse17 (<= ULTIMATE.start_main_~x~4 97)) (and .cse14 (= ULTIMATE.start_main_~x~4 43) .cse15) (and .cse53 .cse52 (= ULTIMATE.start_main_~x~4 23)) (and .cse82 .cse83 (= ULTIMATE.start_main_~x~4 10)) (and .cse78 .cse79 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= 61 ULTIMATE.start_main_~x~4) .cse72 (<= ULTIMATE.start_main_~x~4 61) .cse73) (and .cse94 .cse95 (= ULTIMATE.start_main_~x~4 1)) (and .cse98 .cse99 (= ULTIMATE.start_main_~x~4 0)) (and .cse87 (<= ULTIMATE.start_main_~x~4 62) .cse86 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse63 (= ULTIMATE.start_main_~x~4 41) .cse62) (and .cse90 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse91) (and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66) .cse8 .cse9) (and (<= ULTIMATE.start_main_~x~4 100) .cse98 .cse99 (<= 100 ULTIMATE.start_main_~x~4)) (and .cse85 (= ULTIMATE.start_main_~x~4 42) .cse84) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse51 .cse50) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse92 .cse93) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse96 .cse97) (and (<= 67 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 67)) (and .cse24 (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse25))) [2018-10-01 00:55:28,006 INFO L422 ceAbstractionStarter]: At program point L52(lines 18 52) the Hoare annotation is: (let ((.cse7 (<= ULTIMATE.start_main_~y~4 11)) (.cse6 (<= 11 ULTIMATE.start_main_~y~4)) (.cse2 (<= ULTIMATE.start_main_~y~4 44)) (.cse3 (<= 44 ULTIMATE.start_main_~y~4)) (.cse11 (<= 2 ULTIMATE.start_main_~y~4)) (.cse10 (<= ULTIMATE.start_main_~y~4 2)) (.cse26 (<= ULTIMATE.start_main_~y~4 7)) (.cse27 (<= 7 ULTIMATE.start_main_~y~4)) (.cse12 (<= ULTIMATE.start_main_~y~4 22)) (.cse13 (<= 22 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 6)) (.cse38 (<= 6 ULTIMATE.start_main_~y~4)) (.cse58 (<= ULTIMATE.start_main_~y~4 28)) (.cse59 (<= 28 ULTIMATE.start_main_~y~4)) (.cse54 (<= 49 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 49)) (.cse37 (<= 19 ULTIMATE.start_main_~y~4)) (.cse36 (<= ULTIMATE.start_main_~y~4 19)) (.cse42 (<= 20 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 20)) (.cse60 (<= 25 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 25)) (.cse18 (<= 16 ULTIMATE.start_main_~y~4)) (.cse19 (<= ULTIMATE.start_main_~y~4 16)) (.cse67 (<= 9 ULTIMATE.start_main_~y~4)) (.cse66 (<= ULTIMATE.start_main_~y~4 9)) (.cse32 (<= ULTIMATE.start_main_~y~4 30)) (.cse33 (<= 30 ULTIMATE.start_main_~y~4)) (.cse28 (<= 32 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 32)) (.cse4 (<= 35 ULTIMATE.start_main_~y~4)) (.cse5 (<= ULTIMATE.start_main_~y~4 35)) (.cse65 (<= 13 ULTIMATE.start_main_~y~4)) (.cse64 (<= ULTIMATE.start_main_~y~4 13)) (.cse69 (<= 24 ULTIMATE.start_main_~y~4)) (.cse68 (<= ULTIMATE.start_main_~y~4 24)) (.cse40 (<= 4 ULTIMATE.start_main_~y~4)) (.cse41 (<= ULTIMATE.start_main_~y~4 4)) (.cse20 (<= 21 ULTIMATE.start_main_~y~4)) (.cse21 (<= ULTIMATE.start_main_~y~4 21)) (.cse75 (<= ULTIMATE.start_main_~y~4 5)) (.cse74 (<= 5 ULTIMATE.start_main_~y~4)) (.cse23 (<= ULTIMATE.start_main_~y~4 37)) (.cse22 (<= 37 ULTIMATE.start_main_~y~4)) (.cse46 (<= 17 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 17)) (.cse81 (<= 36 ULTIMATE.start_main_~y~4)) (.cse80 (<= ULTIMATE.start_main_~y~4 36)) (.cse31 (<= 40 ULTIMATE.start_main_~y~4)) (.cse30 (<= ULTIMATE.start_main_~y~4 40)) (.cse70 (<= 8 ULTIMATE.start_main_~y~4)) (.cse71 (<= ULTIMATE.start_main_~y~4 8)) (.cse76 (<= ULTIMATE.start_main_~y~4 46)) (.cse77 (<= 46 ULTIMATE.start_main_~y~4)) (.cse48 (<= 45 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 45)) (.cse35 (<= ULTIMATE.start_main_~y~4 26)) (.cse34 (<= 26 ULTIMATE.start_main_~y~4)) (.cse44 (<= 14 ULTIMATE.start_main_~y~4)) (.cse45 (<= ULTIMATE.start_main_~y~4 14)) (.cse56 (<= 31 ULTIMATE.start_main_~y~4)) (.cse57 (<= ULTIMATE.start_main_~y~4 31)) (.cse88 (<= ULTIMATE.start_main_~y~4 27)) (.cse89 (<= 27 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 3)) (.cse17 (<= 3 ULTIMATE.start_main_~y~4)) (.cse14 (<= 43 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 43)) (.cse53 (<= ULTIMATE.start_main_~y~4 23)) (.cse52 (<= 23 ULTIMATE.start_main_~y~4)) (.cse82 (<= ULTIMATE.start_main_~y~4 10)) (.cse83 (<= 10 ULTIMATE.start_main_~y~4)) (.cse78 (<= ULTIMATE.start_main_~y~4 15)) (.cse79 (<= 15 ULTIMATE.start_main_~y~4)) (.cse72 (<= 39 ULTIMATE.start_main_~y~4)) (.cse73 (<= ULTIMATE.start_main_~y~4 39)) (.cse94 (<= ULTIMATE.start_main_~y~4 1)) (.cse95 (<= 1 ULTIMATE.start_main_~y~4)) (.cse87 (<= 38 ULTIMATE.start_main_~y~4)) (.cse86 (<= ULTIMATE.start_main_~y~4 38)) (.cse63 (<= ULTIMATE.start_main_~y~4 41)) (.cse62 (<= 41 ULTIMATE.start_main_~y~4)) (.cse90 (<= 47 ULTIMATE.start_main_~y~4)) (.cse91 (<= ULTIMATE.start_main_~y~4 47)) (.cse8 (<= ULTIMATE.start_main_~y~4 34)) (.cse9 (<= 34 ULTIMATE.start_main_~y~4)) (.cse98 (<= ULTIMATE.start_main_~y~4 0)) (.cse99 (<= 0 ULTIMATE.start_main_~y~4)) (.cse85 (<= ULTIMATE.start_main_~y~4 42)) (.cse84 (<= 42 ULTIMATE.start_main_~y~4)) (.cse51 (<= ULTIMATE.start_main_~y~4 18)) (.cse50 (<= 18 ULTIMATE.start_main_~y~4)) (.cse92 (<= 48 ULTIMATE.start_main_~y~4)) (.cse93 (<= ULTIMATE.start_main_~y~4 48)) (.cse96 (<= ULTIMATE.start_main_~y~4 29)) (.cse97 (<= 29 ULTIMATE.start_main_~y~4)) (.cse0 (<= 33 ULTIMATE.start_main_~y~4)) (.cse1 (<= ULTIMATE.start_main_~y~4 33)) (.cse24 (<= 12 ULTIMATE.start_main_~y~4)) (.cse25 (<= ULTIMATE.start_main_~y~4 12))) (or (and .cse0 (= ULTIMATE.start_main_~x~4 33) .cse1) (and .cse2 .cse3 (= ULTIMATE.start_main_~x~4 44)) (and .cse4 .cse5 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse6 .cse7) (and .cse7 .cse6 (= ULTIMATE.start_main_~x~4 11)) (and (= ULTIMATE.start_main_~x~4 34) .cse8 .cse9) (and .cse10 (= ULTIMATE.start_main_~x~4 2) .cse11) (and .cse12 (= ULTIMATE.start_main_~x~4 22) .cse13) (and .cse14 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57) .cse15) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 56) .cse2 .cse3) (and .cse16 .cse17 (= ULTIMATE.start_main_~x~4 3)) (and (= ULTIMATE.start_main_~x~4 16) .cse18 .cse19) (and (= ULTIMATE.start_main_~x~4 21) .cse20 .cse21) (and .cse22 .cse23 (= ULTIMATE.start_main_~x~4 37)) (and (= ULTIMATE.start_main_~x~4 12) .cse24 .cse25) (and .cse11 (<= ULTIMATE.start_main_~x~4 98) .cse10 (<= 98 ULTIMATE.start_main_~x~4)) (and .cse26 .cse27 (= ULTIMATE.start_main_~x~4 7)) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse28 .cse29) (and .cse30 .cse31 (= ULTIMATE.start_main_~x~4 40)) (and (= ULTIMATE.start_main_~x~4 30) .cse32 .cse33) (and .cse34 (<= 74 ULTIMATE.start_main_~x~4) .cse35 (<= ULTIMATE.start_main_~x~4 74)) (and (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse36 .cse37) (and (= ULTIMATE.start_main_~x~4 6) .cse38 .cse39) (and .cse40 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4) .cse41) (and .cse26 (<= ULTIMATE.start_main_~x~4 93) .cse27 (<= 93 ULTIMATE.start_main_~x~4)) (and .cse12 (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~x~4) .cse13) (and (= ULTIMATE.start_main_~x~4 20) .cse42 .cse43) (and .cse44 (= ULTIMATE.start_main_~x~4 14) .cse45) (and .cse39 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4) .cse38) (and (<= 83 ULTIMATE.start_main_~x~4) .cse46 .cse47 (<= ULTIMATE.start_main_~x~4 83)) (and .cse48 (= ULTIMATE.start_main_~x~4 45) .cse49) (and .cse50 .cse51 (= ULTIMATE.start_main_~x~4 18)) (and (<= ULTIMATE.start_main_~x~4 77) .cse52 (<= 77 ULTIMATE.start_main_~x~4) .cse53) (and (<= 51 ULTIMATE.start_main_~x~4) .cse54 .cse55 (<= ULTIMATE.start_main_~x~4 51)) (and .cse56 (= ULTIMATE.start_main_~x~4 31) .cse57) (and .cse58 (= ULTIMATE.start_main_~x~4 28) .cse59) (and .cse60 (<= ULTIMATE.start_main_~x~4 75) (<= 75 ULTIMATE.start_main_~x~4) .cse61) (and (<= 72 ULTIMATE.start_main_~x~4) .cse58 (<= ULTIMATE.start_main_~x~4 72) .cse59) (and (= ULTIMATE.start_main_~x~4 49) .cse54 .cse55) (and (<= ULTIMATE.start_main_~x~4 59) .cse62 .cse63 (<= 59 ULTIMATE.start_main_~x~4)) (and .cse37 .cse36 (= ULTIMATE.start_main_~x~4 19)) (and .cse42 (<= ULTIMATE.start_main_~x~4 80) (<= 80 ULTIMATE.start_main_~x~4) .cse43) (and .cse64 .cse65 (= ULTIMATE.start_main_~x~4 13)) (and .cse60 .cse61 (= ULTIMATE.start_main_~x~4 25)) (and (= ULTIMATE.start_main_~x~4 9) .cse66 .cse67) (and (<= ULTIMATE.start_main_~x~4 76) .cse68 (<= 76 ULTIMATE.start_main_~x~4) .cse69) (and .cse18 (<= ULTIMATE.start_main_~x~4 84) .cse19 (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) .cse70 .cse71 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse67 (<= ULTIMATE.start_main_~x~4 91) .cse66 (<= 91 ULTIMATE.start_main_~x~4)) (and .cse32 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse33) (and .cse28 (= ULTIMATE.start_main_~x~4 32) .cse29) (and (= ULTIMATE.start_main_~x~4 35) .cse4 .cse5) (and .cse65 .cse64 (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and .cse72 .cse73 (= ULTIMATE.start_main_~x~4 39)) (and .cse69 .cse68 (= ULTIMATE.start_main_~x~4 24)) (and .cse40 (= ULTIMATE.start_main_~x~4 4) .cse41) (and (<= 79 ULTIMATE.start_main_~x~4) .cse20 (<= ULTIMATE.start_main_~x~4 79) .cse21) (and .cse74 .cse75 (= ULTIMATE.start_main_~x~4 5)) (and (<= ULTIMATE.start_main_~x~4 54) .cse76 (<= 54 ULTIMATE.start_main_~x~4) .cse77) (and .cse78 (= ULTIMATE.start_main_~x~4 15) .cse79) (and .cse75 (<= 95 ULTIMATE.start_main_~x~4) .cse74 (<= ULTIMATE.start_main_~x~4 95)) (and (<= 63 ULTIMATE.start_main_~x~4) .cse23 (<= ULTIMATE.start_main_~x~4 63) .cse22) (and (= ULTIMATE.start_main_~x~4 36) .cse80 .cse81) (and (= ULTIMATE.start_main_~x~4 17) .cse46 .cse47) (and .cse82 (<= ULTIMATE.start_main_~x~4 90) .cse83 (<= 90 ULTIMATE.start_main_~x~4)) (and .cse81 (<= ULTIMATE.start_main_~x~4 64) .cse80 (<= 64 ULTIMATE.start_main_~x~4)) (and .cse31 (<= 60 ULTIMATE.start_main_~x~4) .cse30 (<= ULTIMATE.start_main_~x~4 60)) (and .cse70 .cse71 (= ULTIMATE.start_main_~x~4 8)) (and .cse84 (<= 58 ULTIMATE.start_main_~x~4) .cse85 (<= ULTIMATE.start_main_~x~4 58)) (and .cse86 (= ULTIMATE.start_main_~x~4 38) .cse87) (and (= ULTIMATE.start_main_~x~4 46) .cse76 .cse77) (and .cse88 .cse89 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4)) (and (= ULTIMATE.start_main_~x~4 47) .cse90 .cse91) (and .cse92 (= ULTIMATE.start_main_~x~4 48) .cse93) (and .cse48 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse49) (and (= ULTIMATE.start_main_~x~4 26) .cse35 .cse34) (and (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99) .cse94 .cse95) (and .cse44 (<= 86 ULTIMATE.start_main_~x~4) .cse45 (<= ULTIMATE.start_main_~x~4 86)) (and (= ULTIMATE.start_main_~x~4 29) .cse96 .cse97) (and .cse56 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) .cse57) (and .cse88 (= ULTIMATE.start_main_~x~4 27) .cse89) (and .cse16 (<= 97 ULTIMATE.start_main_~x~4) .cse17 (<= ULTIMATE.start_main_~x~4 97)) (and .cse14 (= ULTIMATE.start_main_~x~4 43) .cse15) (and .cse53 .cse52 (= ULTIMATE.start_main_~x~4 23)) (and .cse82 .cse83 (= ULTIMATE.start_main_~x~4 10)) (and .cse78 .cse79 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= 61 ULTIMATE.start_main_~x~4) .cse72 (<= ULTIMATE.start_main_~x~4 61) .cse73) (and .cse94 .cse95 (= ULTIMATE.start_main_~x~4 1)) (and .cse98 .cse99 (= ULTIMATE.start_main_~x~4 0)) (and .cse87 (<= ULTIMATE.start_main_~x~4 62) .cse86 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse63 (= ULTIMATE.start_main_~x~4 41) .cse62) (and .cse90 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse91) (and (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66) .cse8 .cse9) (and (<= ULTIMATE.start_main_~x~4 100) .cse98 .cse99 (<= 100 ULTIMATE.start_main_~x~4)) (and .cse85 (= ULTIMATE.start_main_~x~4 42) .cse84) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse51 .cse50) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~x~4) (<= 50 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse92 .cse93) (and (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse96 .cse97) (and (<= 67 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 67)) (and .cse24 (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse25))) [2018-10-01 00:55:28,006 INFO L422 ceAbstractionStarter]: At program point L46(lines 46 53) the Hoare annotation is: false [2018-10-01 00:55:28,007 INFO L422 ceAbstractionStarter]: At program point L36(lines 30 47) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_main_~y~4 26)) (.cse3 (<= 26 ULTIMATE.start_main_~y~4)) (.cse8 (<= ULTIMATE.start_main_~y~4 11)) (.cse9 (<= 11 ULTIMATE.start_main_~y~4)) (.cse32 (<= 17 ULTIMATE.start_main_~y~4)) (.cse33 (<= ULTIMATE.start_main_~y~4 17)) (.cse40 (<= 19 ULTIMATE.start_main_~y~4)) (.cse41 (<= ULTIMATE.start_main_~y~4 19)) (.cse34 (<= ULTIMATE.start_main_~y~4 9)) (.cse35 (<= 9 ULTIMATE.start_main_~y~4)) (.cse24 (<= ULTIMATE.start_main_~y~4 10)) (.cse25 (<= 10 ULTIMATE.start_main_~y~4)) (.cse6 (<= 5 ULTIMATE.start_main_~y~4)) (.cse7 (<= ULTIMATE.start_main_~y~4 5)) (.cse4 (<= ULTIMATE.start_main_~y~4 41)) (.cse5 (<= 41 ULTIMATE.start_main_~y~4)) (.cse43 (<= ULTIMATE.start_main_~y~4 28)) (.cse42 (<= 28 ULTIMATE.start_main_~y~4)) (.cse16 (<= ULTIMATE.start_main_~y~4 15)) (.cse17 (<= 15 ULTIMATE.start_main_~y~4)) (.cse59 (<= ULTIMATE.start_main_~y~4 36)) (.cse58 (<= 36 ULTIMATE.start_main_~y~4)) (.cse44 (<= ULTIMATE.start_main_~y~4 38)) (.cse45 (<= 38 ULTIMATE.start_main_~y~4)) (.cse46 (<= 48 ULTIMATE.start_main_~y~4)) (.cse47 (<= ULTIMATE.start_main_~y~4 48)) (.cse28 (<= 20 ULTIMATE.start_main_~y~4)) (.cse29 (<= ULTIMATE.start_main_~y~4 20)) (.cse23 (<= ULTIMATE.start_main_~y~4 49)) (.cse22 (<= 49 ULTIMATE.start_main_~y~4)) (.cse18 (<= ULTIMATE.start_main_~y~4 13)) (.cse19 (<= 13 ULTIMATE.start_main_~y~4)) (.cse62 (<= ULTIMATE.start_main_~y~4 2)) (.cse63 (<= 2 ULTIMATE.start_main_~y~4)) (.cse64 (<= 4 ULTIMATE.start_main_~y~4)) (.cse65 (<= ULTIMATE.start_main_~y~4 4)) (.cse82 (<= ULTIMATE.start_main_~y~4 42)) (.cse83 (<= 42 ULTIMATE.start_main_~y~4)) (.cse56 (<= 47 ULTIMATE.start_main_~y~4)) (.cse57 (<= ULTIMATE.start_main_~y~4 47)) (.cse14 (<= 18 ULTIMATE.start_main_~y~4)) (.cse15 (<= ULTIMATE.start_main_~y~4 18)) (.cse30 (<= 33 ULTIMATE.start_main_~y~4)) (.cse31 (<= ULTIMATE.start_main_~y~4 33)) (.cse27 (<= 39 ULTIMATE.start_main_~y~4)) (.cse26 (<= ULTIMATE.start_main_~y~4 39)) (.cse13 (<= ULTIMATE.start_main_~y~4 46)) (.cse12 (<= 46 ULTIMATE.start_main_~y~4)) (.cse50 (<= ULTIMATE.start_main_~y~4 27)) (.cse51 (<= 27 ULTIMATE.start_main_~y~4)) (.cse61 (<= ULTIMATE.start_main_~y~4 34)) (.cse60 (<= 34 ULTIMATE.start_main_~y~4)) (.cse80 (<= ULTIMATE.start_main_~y~4 7)) (.cse81 (<= 7 ULTIMATE.start_main_~y~4)) (.cse84 (<= ULTIMATE.start_main_~y~4 30)) (.cse85 (<= 30 ULTIMATE.start_main_~y~4)) (.cse74 (<= 31 ULTIMATE.start_main_~y~4)) (.cse75 (<= ULTIMATE.start_main_~y~4 31)) (.cse72 (<= ULTIMATE.start_main_~y~4 22)) (.cse73 (<= 22 ULTIMATE.start_main_~y~4)) (.cse52 (<= ULTIMATE.start_main_~y~4 1)) (.cse53 (<= 1 ULTIMATE.start_main_~y~4)) (.cse36 (<= 6 ULTIMATE.start_main_~y~4)) (.cse37 (<= ULTIMATE.start_main_~y~4 6)) (.cse76 (<= 21 ULTIMATE.start_main_~y~4)) (.cse77 (<= ULTIMATE.start_main_~y~4 21)) (.cse68 (<= ULTIMATE.start_main_~y~4 44)) (.cse69 (<= 44 ULTIMATE.start_main_~y~4)) (.cse88 (<= 16 ULTIMATE.start_main_~y~4)) (.cse89 (<= ULTIMATE.start_main_~y~4 16)) (.cse70 (<= 12 ULTIMATE.start_main_~y~4)) (.cse71 (<= ULTIMATE.start_main_~y~4 12)) (.cse54 (<= 45 ULTIMATE.start_main_~y~4)) (.cse55 (<= ULTIMATE.start_main_~y~4 45)) (.cse21 (<= 29 ULTIMATE.start_main_~y~4)) (.cse20 (<= ULTIMATE.start_main_~y~4 29)) (.cse67 (<= ULTIMATE.start_main_~y~4 35)) (.cse66 (<= 35 ULTIMATE.start_main_~y~4)) (.cse92 (<= ULTIMATE.start_main_~y~4 23)) (.cse93 (<= 23 ULTIMATE.start_main_~y~4)) (.cse78 (<= 14 ULTIMATE.start_main_~y~4)) (.cse79 (<= ULTIMATE.start_main_~y~4 14)) (.cse91 (<= ULTIMATE.start_main_~y~4 37)) (.cse90 (<= 37 ULTIMATE.start_main_~y~4)) (.cse48 (<= 25 ULTIMATE.start_main_~y~4)) (.cse49 (<= ULTIMATE.start_main_~y~4 25)) (.cse1 (<= 40 ULTIMATE.start_main_~y~4)) (.cse0 (<= ULTIMATE.start_main_~y~4 40)) (.cse86 (<= 8 ULTIMATE.start_main_~y~4)) (.cse87 (<= ULTIMATE.start_main_~y~4 8)) (.cse38 (<= 24 ULTIMATE.start_main_~y~4)) (.cse39 (<= ULTIMATE.start_main_~y~4 24)) (.cse10 (<= 43 ULTIMATE.start_main_~y~4)) (.cse11 (<= ULTIMATE.start_main_~y~4 43)) (.cse96 (<= 32 ULTIMATE.start_main_~y~4)) (.cse97 (<= ULTIMATE.start_main_~y~4 32)) (.cse94 (<= ULTIMATE.start_main_~y~4 3)) (.cse95 (<= 3 ULTIMATE.start_main_~y~4))) (or (and (= ULTIMATE.start_main_~x~4 39) .cse0 .cse1) (and .cse2 (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~x~4) .cse3) (and .cse4 .cse5 (= ULTIMATE.start_main_~x~4 40)) (and .cse6 .cse7 (= ULTIMATE.start_main_~x~4 4)) (and .cse8 .cse9 (= ULTIMATE.start_main_~x~4 10)) (and (<= 56 ULTIMATE.start_main_~x~4) .cse10 (<= ULTIMATE.start_main_~x~4 56) .cse11) (and .cse2 .cse3 (= ULTIMATE.start_main_~x~4 25)) (and .cse12 (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) .cse13) (and (<= ULTIMATE.start_main_~x~4 100) (<= (+ ULTIMATE.start_main_~y~4 1) 0) (<= 100 ULTIMATE.start_main_~x~4)) (and .cse14 (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) .cse15) (and .cse16 (= ULTIMATE.start_main_~x~4 14) .cse17) (and (= ULTIMATE.start_main_~x~4 12) .cse18 .cse19) (and (= ULTIMATE.start_main_~x~4 28) .cse20 .cse21) (and .cse22 (= ULTIMATE.start_main_~x~4 48) .cse23) (and .cse24 (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) .cse25) (and .cse26 (<= 60 ULTIMATE.start_main_~x~4) .cse27 (<= ULTIMATE.start_main_~x~4 60)) (and (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88) .cse8 .cse9) (and (<= 79 ULTIMATE.start_main_~x~4) .cse28 (<= ULTIMATE.start_main_~x~4 79) .cse29) (and .cse30 (= ULTIMATE.start_main_~x~4 32) .cse31) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) .cse32 .cse33) (and .cse34 .cse35 (= ULTIMATE.start_main_~x~4 8)) (and (= ULTIMATE.start_main_~x~4 5) .cse36 .cse37) (and (= ULTIMATE.start_main_~x~4 16) .cse32 .cse33) (and .cse38 .cse39 (= ULTIMATE.start_main_~x~4 23)) (and .cse40 (<= ULTIMATE.start_main_~x~4 80) .cse41 (<= 80 ULTIMATE.start_main_~x~4)) (and .cse42 (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) .cse43) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) .cse44 .cse45) (and (<= 51 ULTIMATE.start_main_~x~4) .cse46 .cse47 (<= ULTIMATE.start_main_~x~4 51)) (and .cse48 .cse49 (= ULTIMATE.start_main_~x~4 24)) (and .cse40 .cse41 (= ULTIMATE.start_main_~x~4 18)) (and .cse50 (<= 72 ULTIMATE.start_main_~x~4) .cse51 (<= ULTIMATE.start_main_~x~4 72)) (and .cse52 (= ULTIMATE.start_main_~x~4 0) .cse53) (and .cse54 (= ULTIMATE.start_main_~x~4 44) .cse55) (and (<= ULTIMATE.start_main_~x~4 90) .cse34 (<= 90 ULTIMATE.start_main_~x~4) .cse35) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) .cse56 .cse57) (and .cse58 (<= 63 ULTIMATE.start_main_~x~4) .cse59 (<= ULTIMATE.start_main_~x~4 63)) (and .cse24 (= ULTIMATE.start_main_~x~4 9) .cse25) (and .cse60 .cse61 (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65)) (and .cse6 .cse7 (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 0) (<= 0 ULTIMATE.start_main_~y~4) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and .cse4 .cse5 (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 58)) (and (= ULTIMATE.start_main_~x~4 27) .cse43 .cse42) (and .cse62 .cse63 (= ULTIMATE.start_main_~x~4 1)) (and .cse64 (<= 95 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 95) .cse65) (and .cse16 (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~x~4) .cse17) (and (= ULTIMATE.start_main_~x~4 35) .cse59 .cse58) (and (= ULTIMATE.start_main_~x~4 34) .cse66 .cse67) (and .cse44 (= ULTIMATE.start_main_~x~4 37) .cse45) (and .cse68 (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55) .cse69) (and .cse46 (= ULTIMATE.start_main_~x~4 47) .cse47) (and .cse28 .cse29 (= ULTIMATE.start_main_~x~4 19)) (and .cse70 (<= ULTIMATE.start_main_~x~4 87) .cse71 (<= 87 ULTIMATE.start_main_~x~4)) (and .cse72 (= ULTIMATE.start_main_~x~4 21) .cse73) (and .cse74 (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) .cse75) (and (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~x~4) .cse23 .cse22) (and .cse18 .cse19 (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (= ULTIMATE.start_main_~x~4 20) .cse76 .cse77) (and .cse62 (<= 97 ULTIMATE.start_main_~x~4) .cse63 (<= ULTIMATE.start_main_~x~4 97)) (and .cse78 .cse79 (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and .cse80 (<= ULTIMATE.start_main_~x~4 92) .cse81 (<= 92 ULTIMATE.start_main_~x~4)) (and .cse82 .cse83 (= ULTIMATE.start_main_~x~4 41)) (and .cse64 (= ULTIMATE.start_main_~x~4 3) .cse65) (and .cse82 .cse83 (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and .cse56 (= ULTIMATE.start_main_~x~4 46) .cse57) (and (<= ULTIMATE.start_main_~y~4 50) (= ULTIMATE.start_main_~x~4 49) (<= 50 ULTIMATE.start_main_~y~4)) (and .cse84 (= ULTIMATE.start_main_~x~4 29) .cse85) (and .cse14 (= ULTIMATE.start_main_~x~4 17) .cse15) (and .cse30 (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 66) .cse31) (and .cse27 .cse26 (= ULTIMATE.start_main_~x~4 38)) (and (= ULTIMATE.start_main_~x~4 7) .cse86 .cse87) (and .cse13 (= ULTIMATE.start_main_~x~4 45) .cse12) (and (= ULTIMATE.start_main_~x~4 15) .cse88 .cse89) (and (= ULTIMATE.start_main_~x~4 26) .cse50 .cse51) (and (= ULTIMATE.start_main_~x~4 33) .cse61 .cse60) (and .cse80 (= ULTIMATE.start_main_~x~4 6) .cse81) (and .cse84 .cse85 (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69)) (and .cse90 (= ULTIMATE.start_main_~x~4 36) .cse91) (and (= ULTIMATE.start_main_~x~4 30) .cse74 .cse75) (and (<= ULTIMATE.start_main_~x~4 77) .cse72 (<= 77 ULTIMATE.start_main_~x~4) .cse73) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) .cse52 .cse53) (and .cse36 .cse37 (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 76) .cse92 .cse93 (<= 76 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 78) .cse76 (<= 78 ULTIMATE.start_main_~x~4) .cse77) (and (= ULTIMATE.start_main_~x~4 43) .cse68 .cse69) (and (<= 83 ULTIMATE.start_main_~x~4) .cse88 .cse89 (<= ULTIMATE.start_main_~x~4 83)) (and .cse70 .cse71 (= ULTIMATE.start_main_~x~4 11)) (and (<= ULTIMATE.start_main_~x~4 54) .cse54 (<= 54 ULTIMATE.start_main_~x~4) .cse55) (and .cse21 (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) .cse20) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) .cse67 .cse66) (and .cse92 .cse93 (= ULTIMATE.start_main_~x~4 22)) (and .cse78 (= ULTIMATE.start_main_~x~4 13) .cse79) (and (<= ULTIMATE.start_main_~x~4 62) .cse91 .cse90 (<= 62 ULTIMATE.start_main_~x~4)) (and .cse94 (= ULTIMATE.start_main_~x~4 2) .cse95) (and (<= 74 ULTIMATE.start_main_~x~4) .cse48 .cse49 (<= ULTIMATE.start_main_~x~4 74)) (and .cse96 (= ULTIMATE.start_main_~x~4 31) .cse97) (and .cse1 (<= ULTIMATE.start_main_~x~4 59) .cse0 (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 91) .cse86 (<= 91 ULTIMATE.start_main_~x~4) .cse87) (and (<= ULTIMATE.start_main_~x~4 75) .cse38 (<= 75 ULTIMATE.start_main_~x~4) .cse39) (and .cse10 (= ULTIMATE.start_main_~x~4 42) .cse11) (and (<= 67 ULTIMATE.start_main_~x~4) .cse96 .cse97 (<= ULTIMATE.start_main_~x~4 67)) (and .cse94 .cse95 (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)))) [2018-10-01 00:55:28,056 INFO L202 PluginConnector]: Adding new model gr2006.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:55:28 BoogieIcfgContainer [2018-10-01 00:55:28,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:55:28,057 INFO L168 Benchmark]: Toolchain (without parser) took 203677.25 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 318.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-01 00:55:28,058 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:28,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:28,060 INFO L168 Benchmark]: Boogie Preprocessor took 25.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:55:28,060 INFO L168 Benchmark]: RCFGBuilder took 263.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:55:28,061 INFO L168 Benchmark]: TraceAbstraction took 203338.46 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 286.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-01 00:55:28,065 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.05 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 263.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203338.46 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 286.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: 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: 22]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((33 <= main_~y~4 && main_~x~4 == 33) && main_~y~4 <= 33) || ((main_~y~4 <= 44 && 44 <= main_~y~4) && main_~x~4 == 44)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~x~4 <= 89 && 89 <= main_~x~4) && 11 <= main_~y~4) && main_~y~4 <= 11)) || ((main_~y~4 <= 11 && 11 <= main_~y~4) && main_~x~4 == 11)) || ((main_~x~4 == 34 && main_~y~4 <= 34) && 34 <= main_~y~4)) || ((main_~y~4 <= 2 && main_~x~4 == 2) && 2 <= main_~y~4)) || ((main_~y~4 <= 22 && main_~x~4 == 22) && 22 <= main_~y~4)) || (((43 <= main_~y~4 && 57 <= main_~x~4) && main_~x~4 <= 57) && main_~y~4 <= 43)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || ((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 == 3)) || ((main_~x~4 == 16 && 16 <= main_~y~4) && main_~y~4 <= 16)) || ((main_~x~4 == 21 && 21 <= main_~y~4) && main_~y~4 <= 21)) || ((37 <= main_~y~4 && main_~y~4 <= 37) && main_~x~4 == 37)) || ((main_~x~4 == 12 && 12 <= main_~y~4) && main_~y~4 <= 12)) || (((2 <= main_~y~4 && main_~x~4 <= 98) && main_~y~4 <= 2) && 98 <= main_~x~4)) || ((main_~y~4 <= 7 && 7 <= main_~y~4) && main_~x~4 == 7)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 32 <= main_~y~4) && main_~y~4 <= 32)) || ((main_~y~4 <= 40 && 40 <= main_~y~4) && main_~x~4 == 40)) || ((main_~x~4 == 30 && main_~y~4 <= 30) && 30 <= main_~y~4)) || (((26 <= main_~y~4 && 74 <= main_~x~4) && main_~y~4 <= 26) && main_~x~4 <= 74)) || (((main_~x~4 <= 81 && 81 <= main_~x~4) && main_~y~4 <= 19) && 19 <= main_~y~4)) || ((main_~x~4 == 6 && 6 <= main_~y~4) && main_~y~4 <= 6)) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~y~4 <= 7 && main_~x~4 <= 93) && 7 <= main_~y~4) && 93 <= main_~x~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 78) && 78 <= main_~x~4) && 22 <= main_~y~4)) || ((main_~x~4 == 20 && 20 <= main_~y~4) && main_~y~4 <= 20)) || ((14 <= main_~y~4 && main_~x~4 == 14) && main_~y~4 <= 14)) || (((main_~y~4 <= 6 && main_~x~4 <= 94) && 94 <= main_~x~4) && 6 <= main_~y~4)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || ((45 <= main_~y~4 && main_~x~4 == 45) && main_~y~4 <= 45)) || ((18 <= main_~y~4 && main_~y~4 <= 18) && main_~x~4 == 18)) || (((main_~x~4 <= 77 && 23 <= main_~y~4) && 77 <= main_~x~4) && main_~y~4 <= 23)) || (((51 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 51)) || ((31 <= main_~y~4 && main_~x~4 == 31) && main_~y~4 <= 31)) || ((main_~y~4 <= 28 && main_~x~4 == 28) && 28 <= main_~y~4)) || (((25 <= main_~y~4 && main_~x~4 <= 75) && 75 <= main_~x~4) && main_~y~4 <= 25)) || (((72 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 72) && 28 <= main_~y~4)) || ((main_~x~4 == 49 && 49 <= main_~y~4) && main_~y~4 <= 49)) || (((main_~x~4 <= 59 && 41 <= main_~y~4) && main_~y~4 <= 41) && 59 <= main_~x~4)) || ((19 <= main_~y~4 && main_~y~4 <= 19) && main_~x~4 == 19)) || (((20 <= main_~y~4 && main_~x~4 <= 80) && 80 <= main_~x~4) && main_~y~4 <= 20)) || ((main_~y~4 <= 13 && 13 <= main_~y~4) && main_~x~4 == 13)) || ((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 == 25)) || ((main_~x~4 == 9 && main_~y~4 <= 9) && 9 <= main_~y~4)) || (((main_~x~4 <= 76 && main_~y~4 <= 24) && 76 <= main_~x~4) && 24 <= main_~y~4)) || (((16 <= main_~y~4 && main_~x~4 <= 84) && main_~y~4 <= 16) && 84 <= main_~x~4)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((9 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 9) && 91 <= main_~x~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 70 <= main_~x~4) && 30 <= main_~y~4)) || ((32 <= main_~y~4 && main_~x~4 == 32) && main_~y~4 <= 32)) || ((main_~x~4 == 35 && 35 <= main_~y~4) && main_~y~4 <= 35)) || (((13 <= main_~y~4 && main_~y~4 <= 13) && main_~x~4 <= 87) && 87 <= main_~x~4)) || ((39 <= main_~y~4 && main_~y~4 <= 39) && main_~x~4 == 39)) || ((24 <= main_~y~4 && main_~y~4 <= 24) && main_~x~4 == 24)) || ((4 <= main_~y~4 && main_~x~4 == 4) && main_~y~4 <= 4)) || (((79 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 21)) || ((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 == 5)) || (((main_~x~4 <= 54 && main_~y~4 <= 46) && 54 <= main_~x~4) && 46 <= main_~y~4)) || ((main_~y~4 <= 15 && main_~x~4 == 15) && 15 <= main_~y~4)) || (((main_~y~4 <= 5 && 95 <= main_~x~4) && 5 <= main_~y~4) && main_~x~4 <= 95)) || (((63 <= main_~x~4 && main_~y~4 <= 37) && main_~x~4 <= 63) && 37 <= main_~y~4)) || ((main_~x~4 == 36 && main_~y~4 <= 36) && 36 <= main_~y~4)) || ((main_~x~4 == 17 && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 10 <= main_~y~4) && 90 <= main_~x~4)) || (((36 <= main_~y~4 && main_~x~4 <= 64) && main_~y~4 <= 36) && 64 <= main_~x~4)) || (((40 <= main_~y~4 && 60 <= main_~x~4) && main_~y~4 <= 40) && main_~x~4 <= 60)) || ((8 <= main_~y~4 && main_~y~4 <= 8) && main_~x~4 == 8)) || (((42 <= main_~y~4 && 58 <= main_~x~4) && main_~y~4 <= 42) && main_~x~4 <= 58)) || ((main_~y~4 <= 38 && main_~x~4 == 38) && 38 <= main_~y~4)) || ((main_~x~4 == 46 && main_~y~4 <= 46) && 46 <= main_~y~4)) || (((main_~y~4 <= 27 && 27 <= main_~y~4) && main_~x~4 <= 73) && 73 <= main_~x~4)) || ((main_~x~4 == 47 && 47 <= main_~y~4) && main_~y~4 <= 47)) || ((48 <= main_~y~4 && main_~x~4 == 48) && main_~y~4 <= 48)) || (((45 <= main_~y~4 && 55 <= main_~x~4) && main_~x~4 <= 55) && main_~y~4 <= 45)) || ((main_~x~4 == 26 && main_~y~4 <= 26) && 26 <= main_~y~4)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((14 <= main_~y~4 && 86 <= main_~x~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || ((main_~x~4 == 29 && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((31 <= main_~y~4 && 69 <= main_~x~4) && main_~x~4 <= 69) && main_~y~4 <= 31)) || ((main_~y~4 <= 27 && main_~x~4 == 27) && 27 <= main_~y~4)) || (((main_~y~4 <= 3 && 97 <= main_~x~4) && 3 <= main_~y~4) && main_~x~4 <= 97)) || ((43 <= main_~y~4 && main_~x~4 == 43) && main_~y~4 <= 43)) || ((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 == 23)) || ((main_~y~4 <= 10 && 10 <= main_~y~4) && main_~x~4 == 10)) || (((main_~y~4 <= 15 && 15 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((61 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 39)) || ((main_~y~4 <= 1 && 1 <= main_~y~4) && main_~x~4 == 1)) || ((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 == 0)) || (((38 <= main_~y~4 && main_~x~4 <= 62) && main_~y~4 <= 38) && 62 <= main_~x~4)) || ((main_~y~4 <= 41 && main_~x~4 == 41) && 41 <= main_~y~4)) || (((47 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 47)) || (((66 <= main_~x~4 && main_~x~4 <= 66) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((main_~x~4 <= 100 && main_~y~4 <= 0) && 0 <= main_~y~4) && 100 <= main_~x~4)) || ((main_~y~4 <= 42 && main_~x~4 == 42) && 42 <= main_~y~4)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && main_~y~4 <= 18) && 18 <= main_~y~4)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 48 <= main_~y~4) && main_~y~4 <= 48)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((67 <= main_~x~4 && 33 <= main_~y~4) && main_~y~4 <= 33) && main_~x~4 <= 67)) || (((12 <= main_~y~4 && 88 <= main_~x~4) && main_~x~4 <= 88) && main_~y~4 <= 12) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((33 <= main_~y~4 && main_~x~4 == 33) && main_~y~4 <= 33) || ((main_~y~4 <= 44 && 44 <= main_~y~4) && main_~x~4 == 44)) || (((35 <= main_~y~4 && main_~y~4 <= 35) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((main_~x~4 <= 89 && 89 <= main_~x~4) && 11 <= main_~y~4) && main_~y~4 <= 11)) || ((main_~y~4 <= 11 && 11 <= main_~y~4) && main_~x~4 == 11)) || ((main_~x~4 == 34 && main_~y~4 <= 34) && 34 <= main_~y~4)) || ((main_~y~4 <= 2 && main_~x~4 == 2) && 2 <= main_~y~4)) || ((main_~y~4 <= 22 && main_~x~4 == 22) && 22 <= main_~y~4)) || (((43 <= main_~y~4 && 57 <= main_~x~4) && main_~x~4 <= 57) && main_~y~4 <= 43)) || (((56 <= main_~x~4 && main_~x~4 <= 56) && main_~y~4 <= 44) && 44 <= main_~y~4)) || ((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 == 3)) || ((main_~x~4 == 16 && 16 <= main_~y~4) && main_~y~4 <= 16)) || ((main_~x~4 == 21 && 21 <= main_~y~4) && main_~y~4 <= 21)) || ((37 <= main_~y~4 && main_~y~4 <= 37) && main_~x~4 == 37)) || ((main_~x~4 == 12 && 12 <= main_~y~4) && main_~y~4 <= 12)) || (((2 <= main_~y~4 && main_~x~4 <= 98) && main_~y~4 <= 2) && 98 <= main_~x~4)) || ((main_~y~4 <= 7 && 7 <= main_~y~4) && main_~x~4 == 7)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && 32 <= main_~y~4) && main_~y~4 <= 32)) || ((main_~y~4 <= 40 && 40 <= main_~y~4) && main_~x~4 == 40)) || ((main_~x~4 == 30 && main_~y~4 <= 30) && 30 <= main_~y~4)) || (((26 <= main_~y~4 && 74 <= main_~x~4) && main_~y~4 <= 26) && main_~x~4 <= 74)) || (((main_~x~4 <= 81 && 81 <= main_~x~4) && main_~y~4 <= 19) && 19 <= main_~y~4)) || ((main_~x~4 == 6 && 6 <= main_~y~4) && main_~y~4 <= 6)) || (((4 <= main_~y~4 && main_~x~4 <= 96) && 96 <= main_~x~4) && main_~y~4 <= 4)) || (((main_~y~4 <= 7 && main_~x~4 <= 93) && 7 <= main_~y~4) && 93 <= main_~x~4)) || (((main_~y~4 <= 22 && main_~x~4 <= 78) && 78 <= main_~x~4) && 22 <= main_~y~4)) || ((main_~x~4 == 20 && 20 <= main_~y~4) && main_~y~4 <= 20)) || ((14 <= main_~y~4 && main_~x~4 == 14) && main_~y~4 <= 14)) || (((main_~y~4 <= 6 && main_~x~4 <= 94) && 94 <= main_~x~4) && 6 <= main_~y~4)) || (((83 <= main_~x~4 && 17 <= main_~y~4) && main_~y~4 <= 17) && main_~x~4 <= 83)) || ((45 <= main_~y~4 && main_~x~4 == 45) && main_~y~4 <= 45)) || ((18 <= main_~y~4 && main_~y~4 <= 18) && main_~x~4 == 18)) || (((main_~x~4 <= 77 && 23 <= main_~y~4) && 77 <= main_~x~4) && main_~y~4 <= 23)) || (((51 <= main_~x~4 && 49 <= main_~y~4) && main_~y~4 <= 49) && main_~x~4 <= 51)) || ((31 <= main_~y~4 && main_~x~4 == 31) && main_~y~4 <= 31)) || ((main_~y~4 <= 28 && main_~x~4 == 28) && 28 <= main_~y~4)) || (((25 <= main_~y~4 && main_~x~4 <= 75) && 75 <= main_~x~4) && main_~y~4 <= 25)) || (((72 <= main_~x~4 && main_~y~4 <= 28) && main_~x~4 <= 72) && 28 <= main_~y~4)) || ((main_~x~4 == 49 && 49 <= main_~y~4) && main_~y~4 <= 49)) || (((main_~x~4 <= 59 && 41 <= main_~y~4) && main_~y~4 <= 41) && 59 <= main_~x~4)) || ((19 <= main_~y~4 && main_~y~4 <= 19) && main_~x~4 == 19)) || (((20 <= main_~y~4 && main_~x~4 <= 80) && 80 <= main_~x~4) && main_~y~4 <= 20)) || ((main_~y~4 <= 13 && 13 <= main_~y~4) && main_~x~4 == 13)) || ((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 == 25)) || ((main_~x~4 == 9 && main_~y~4 <= 9) && 9 <= main_~y~4)) || (((main_~x~4 <= 76 && main_~y~4 <= 24) && 76 <= main_~x~4) && 24 <= main_~y~4)) || (((16 <= main_~y~4 && main_~x~4 <= 84) && main_~y~4 <= 16) && 84 <= main_~x~4)) || (((main_~x~4 <= 92 && 8 <= main_~y~4) && main_~y~4 <= 8) && 92 <= main_~x~4)) || (((9 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 9) && 91 <= main_~x~4)) || (((main_~y~4 <= 30 && main_~x~4 <= 70) && 70 <= main_~x~4) && 30 <= main_~y~4)) || ((32 <= main_~y~4 && main_~x~4 == 32) && main_~y~4 <= 32)) || ((main_~x~4 == 35 && 35 <= main_~y~4) && main_~y~4 <= 35)) || (((13 <= main_~y~4 && main_~y~4 <= 13) && main_~x~4 <= 87) && 87 <= main_~x~4)) || ((39 <= main_~y~4 && main_~y~4 <= 39) && main_~x~4 == 39)) || ((24 <= main_~y~4 && main_~y~4 <= 24) && main_~x~4 == 24)) || ((4 <= main_~y~4 && main_~x~4 == 4) && main_~y~4 <= 4)) || (((79 <= main_~x~4 && 21 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 21)) || ((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 == 5)) || (((main_~x~4 <= 54 && main_~y~4 <= 46) && 54 <= main_~x~4) && 46 <= main_~y~4)) || ((main_~y~4 <= 15 && main_~x~4 == 15) && 15 <= main_~y~4)) || (((main_~y~4 <= 5 && 95 <= main_~x~4) && 5 <= main_~y~4) && main_~x~4 <= 95)) || (((63 <= main_~x~4 && main_~y~4 <= 37) && main_~x~4 <= 63) && 37 <= main_~y~4)) || ((main_~x~4 == 36 && main_~y~4 <= 36) && 36 <= main_~y~4)) || ((main_~x~4 == 17 && 17 <= main_~y~4) && main_~y~4 <= 17)) || (((main_~y~4 <= 10 && main_~x~4 <= 90) && 10 <= main_~y~4) && 90 <= main_~x~4)) || (((36 <= main_~y~4 && main_~x~4 <= 64) && main_~y~4 <= 36) && 64 <= main_~x~4)) || (((40 <= main_~y~4 && 60 <= main_~x~4) && main_~y~4 <= 40) && main_~x~4 <= 60)) || ((8 <= main_~y~4 && main_~y~4 <= 8) && main_~x~4 == 8)) || (((42 <= main_~y~4 && 58 <= main_~x~4) && main_~y~4 <= 42) && main_~x~4 <= 58)) || ((main_~y~4 <= 38 && main_~x~4 == 38) && 38 <= main_~y~4)) || ((main_~x~4 == 46 && main_~y~4 <= 46) && 46 <= main_~y~4)) || (((main_~y~4 <= 27 && 27 <= main_~y~4) && main_~x~4 <= 73) && 73 <= main_~x~4)) || ((main_~x~4 == 47 && 47 <= main_~y~4) && main_~y~4 <= 47)) || ((48 <= main_~y~4 && main_~x~4 == 48) && main_~y~4 <= 48)) || (((45 <= main_~y~4 && 55 <= main_~x~4) && main_~x~4 <= 55) && main_~y~4 <= 45)) || ((main_~x~4 == 26 && main_~y~4 <= 26) && 26 <= main_~y~4)) || (((99 <= main_~x~4 && main_~x~4 <= 99) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((14 <= main_~y~4 && 86 <= main_~x~4) && main_~y~4 <= 14) && main_~x~4 <= 86)) || ((main_~x~4 == 29 && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((31 <= main_~y~4 && 69 <= main_~x~4) && main_~x~4 <= 69) && main_~y~4 <= 31)) || ((main_~y~4 <= 27 && main_~x~4 == 27) && 27 <= main_~y~4)) || (((main_~y~4 <= 3 && 97 <= main_~x~4) && 3 <= main_~y~4) && main_~x~4 <= 97)) || ((43 <= main_~y~4 && main_~x~4 == 43) && main_~y~4 <= 43)) || ((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 == 23)) || ((main_~y~4 <= 10 && 10 <= main_~y~4) && main_~x~4 == 10)) || (((main_~y~4 <= 15 && 15 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((61 <= main_~x~4 && 39 <= main_~y~4) && main_~x~4 <= 61) && main_~y~4 <= 39)) || ((main_~y~4 <= 1 && 1 <= main_~y~4) && main_~x~4 == 1)) || ((main_~y~4 <= 0 && 0 <= main_~y~4) && main_~x~4 == 0)) || (((38 <= main_~y~4 && main_~x~4 <= 62) && main_~y~4 <= 38) && 62 <= main_~x~4)) || ((main_~y~4 <= 41 && main_~x~4 == 41) && 41 <= main_~y~4)) || (((47 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 47)) || (((66 <= main_~x~4 && main_~x~4 <= 66) && main_~y~4 <= 34) && 34 <= main_~y~4)) || (((main_~x~4 <= 100 && main_~y~4 <= 0) && 0 <= main_~y~4) && 100 <= main_~x~4)) || ((main_~y~4 <= 42 && main_~x~4 == 42) && 42 <= main_~y~4)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && main_~y~4 <= 18) && 18 <= main_~y~4)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 48 <= main_~y~4) && main_~y~4 <= 48)) || (((71 <= main_~x~4 && main_~x~4 <= 71) && main_~y~4 <= 29) && 29 <= main_~y~4)) || (((67 <= main_~x~4 && 33 <= main_~y~4) && main_~y~4 <= 33) && main_~x~4 <= 67)) || (((12 <= main_~y~4 && 88 <= main_~x~4) && main_~x~4 <= 88) && main_~y~4 <= 12) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~x~4 == 39 && main_~y~4 <= 40) && 40 <= main_~y~4) || (((main_~y~4 <= 26 && main_~x~4 <= 73) && 73 <= main_~x~4) && 26 <= main_~y~4)) || ((main_~y~4 <= 41 && 41 <= main_~y~4) && main_~x~4 == 40)) || ((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 == 4)) || ((main_~y~4 <= 11 && 11 <= main_~y~4) && main_~x~4 == 10)) || (((56 <= main_~x~4 && 43 <= main_~y~4) && main_~x~4 <= 56) && main_~y~4 <= 43)) || ((main_~y~4 <= 26 && 26 <= main_~y~4) && main_~x~4 == 25)) || (((46 <= main_~y~4 && 53 <= main_~x~4) && main_~x~4 <= 53) && main_~y~4 <= 46)) || ((main_~x~4 <= 100 && main_~y~4 + 1 <= 0) && 100 <= main_~x~4)) || (((18 <= main_~y~4 && main_~x~4 <= 81) && 81 <= main_~x~4) && main_~y~4 <= 18)) || ((main_~y~4 <= 15 && main_~x~4 == 14) && 15 <= main_~y~4)) || ((main_~x~4 == 12 && main_~y~4 <= 13) && 13 <= main_~y~4)) || ((main_~x~4 == 28 && main_~y~4 <= 29) && 29 <= main_~y~4)) || ((49 <= main_~y~4 && main_~x~4 == 48) && main_~y~4 <= 49)) || (((main_~y~4 <= 10 && main_~x~4 <= 89) && 89 <= main_~x~4) && 10 <= main_~y~4)) || (((main_~y~4 <= 39 && 60 <= main_~x~4) && 39 <= main_~y~4) && main_~x~4 <= 60)) || (((88 <= main_~x~4 && main_~x~4 <= 88) && main_~y~4 <= 11) && 11 <= main_~y~4)) || (((79 <= main_~x~4 && 20 <= main_~y~4) && main_~x~4 <= 79) && main_~y~4 <= 20)) || ((33 <= main_~y~4 && main_~x~4 == 32) && main_~y~4 <= 33)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 17 <= main_~y~4) && main_~y~4 <= 17)) || ((main_~y~4 <= 9 && 9 <= main_~y~4) && main_~x~4 == 8)) || ((main_~x~4 == 5 && 6 <= main_~y~4) && main_~y~4 <= 6)) || ((main_~x~4 == 16 && 17 <= main_~y~4) && main_~y~4 <= 17)) || ((24 <= main_~y~4 && main_~y~4 <= 24) && main_~x~4 == 23)) || (((19 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 19) && 80 <= main_~x~4)) || (((28 <= main_~y~4 && 71 <= main_~x~4) && main_~x~4 <= 71) && main_~y~4 <= 28)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && main_~y~4 <= 38) && 38 <= main_~y~4)) || (((51 <= main_~x~4 && 48 <= main_~y~4) && main_~y~4 <= 48) && main_~x~4 <= 51)) || ((25 <= main_~y~4 && main_~y~4 <= 25) && main_~x~4 == 24)) || ((19 <= main_~y~4 && main_~y~4 <= 19) && main_~x~4 == 18)) || (((main_~y~4 <= 27 && 72 <= main_~x~4) && 27 <= main_~y~4) && main_~x~4 <= 72)) || ((main_~y~4 <= 1 && main_~x~4 == 0) && 1 <= main_~y~4)) || ((45 <= main_~y~4 && main_~x~4 == 44) && main_~y~4 <= 45)) || (((main_~x~4 <= 90 && main_~y~4 <= 9) && 90 <= main_~x~4) && 9 <= main_~y~4)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 47 <= main_~y~4) && main_~y~4 <= 47)) || (((36 <= main_~y~4 && 63 <= main_~x~4) && main_~y~4 <= 36) && main_~x~4 <= 63)) || ((main_~y~4 <= 10 && main_~x~4 == 9) && 10 <= main_~y~4)) || (((34 <= main_~y~4 && main_~y~4 <= 34) && 65 <= main_~x~4) && main_~x~4 <= 65)) || (((5 <= main_~y~4 && main_~y~4 <= 5) && main_~x~4 <= 94) && 94 <= main_~x~4)) || (((main_~y~4 <= 0 && 0 <= main_~y~4) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((main_~y~4 <= 41 && 41 <= main_~y~4) && 58 <= main_~x~4) && main_~x~4 <= 58)) || ((main_~x~4 == 27 && main_~y~4 <= 28) && 28 <= main_~y~4)) || ((main_~y~4 <= 2 && 2 <= main_~y~4) && main_~x~4 == 1)) || (((4 <= main_~y~4 && 95 <= main_~x~4) && main_~x~4 <= 95) && main_~y~4 <= 4)) || (((main_~y~4 <= 15 && main_~x~4 <= 84) && 84 <= main_~x~4) && 15 <= main_~y~4)) || ((main_~x~4 == 35 && main_~y~4 <= 36) && 36 <= main_~y~4)) || ((main_~x~4 == 34 && 35 <= main_~y~4) && main_~y~4 <= 35)) || ((main_~y~4 <= 38 && main_~x~4 == 37) && 38 <= main_~y~4)) || (((main_~y~4 <= 44 && 55 <= main_~x~4) && main_~x~4 <= 55) && 44 <= main_~y~4)) || ((48 <= main_~y~4 && main_~x~4 == 47) && main_~y~4 <= 48)) || ((20 <= main_~y~4 && main_~y~4 <= 20) && main_~x~4 == 19)) || (((12 <= main_~y~4 && main_~x~4 <= 87) && main_~y~4 <= 12) && 87 <= main_~x~4)) || ((main_~y~4 <= 22 && main_~x~4 == 21) && 22 <= main_~y~4)) || (((31 <= main_~y~4 && main_~x~4 <= 68) && 68 <= main_~x~4) && main_~y~4 <= 31)) || (((main_~x~4 <= 50 && 50 <= main_~x~4) && main_~y~4 <= 49) && 49 <= main_~y~4)) || (((main_~y~4 <= 13 && 13 <= main_~y~4) && 86 <= main_~x~4) && main_~x~4 <= 86)) || ((main_~x~4 == 20 && 21 <= main_~y~4) && main_~y~4 <= 21)) || (((main_~y~4 <= 2 && 97 <= main_~x~4) && 2 <= main_~y~4) && main_~x~4 <= 97)) || (((14 <= main_~y~4 && main_~y~4 <= 14) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 7 && main_~x~4 <= 92) && 7 <= main_~y~4) && 92 <= main_~x~4)) || ((main_~y~4 <= 42 && 42 <= main_~y~4) && main_~x~4 == 41)) || ((4 <= main_~y~4 && main_~x~4 == 3) && main_~y~4 <= 4)) || (((main_~y~4 <= 42 && 42 <= main_~y~4) && 57 <= main_~x~4) && main_~x~4 <= 57)) || ((47 <= main_~y~4 && main_~x~4 == 46) && main_~y~4 <= 47)) || ((main_~y~4 <= 50 && main_~x~4 == 49) && 50 <= main_~y~4)) || ((main_~y~4 <= 30 && main_~x~4 == 29) && 30 <= main_~y~4)) || ((18 <= main_~y~4 && main_~x~4 == 17) && main_~y~4 <= 18)) || (((33 <= main_~y~4 && 66 <= main_~x~4) && main_~x~4 <= 66) && main_~y~4 <= 33)) || ((39 <= main_~y~4 && main_~y~4 <= 39) && main_~x~4 == 38)) || ((main_~x~4 == 7 && 8 <= main_~y~4) && main_~y~4 <= 8)) || ((main_~y~4 <= 46 && main_~x~4 == 45) && 46 <= main_~y~4)) || ((main_~x~4 == 15 && 16 <= main_~y~4) && main_~y~4 <= 16)) || ((main_~x~4 == 26 && main_~y~4 <= 27) && 27 <= main_~y~4)) || ((main_~x~4 == 33 && main_~y~4 <= 34) && 34 <= main_~y~4)) || ((main_~y~4 <= 7 && main_~x~4 == 6) && 7 <= main_~y~4)) || (((main_~y~4 <= 30 && 30 <= main_~y~4) && 69 <= main_~x~4) && main_~x~4 <= 69)) || ((37 <= main_~y~4 && main_~x~4 == 36) && main_~y~4 <= 37)) || ((main_~x~4 == 30 && 31 <= main_~y~4) && main_~y~4 <= 31)) || (((main_~x~4 <= 77 && main_~y~4 <= 22) && 77 <= main_~x~4) && 22 <= main_~y~4)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 1) && 1 <= main_~y~4)) || (((6 <= main_~y~4 && main_~y~4 <= 6) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 76 && main_~y~4 <= 23) && 23 <= main_~y~4) && 76 <= main_~x~4)) || (((main_~x~4 <= 78 && 21 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 21)) || ((main_~x~4 == 43 && main_~y~4 <= 44) && 44 <= main_~y~4)) || (((83 <= main_~x~4 && 16 <= main_~y~4) && main_~y~4 <= 16) && main_~x~4 <= 83)) || ((12 <= main_~y~4 && main_~y~4 <= 12) && main_~x~4 == 11)) || (((main_~x~4 <= 54 && 45 <= main_~y~4) && 54 <= main_~x~4) && main_~y~4 <= 45)) || (((29 <= main_~y~4 && main_~x~4 <= 70) && 70 <= main_~x~4) && main_~y~4 <= 29)) || (((main_~x~4 <= 64 && 64 <= main_~x~4) && main_~y~4 <= 35) && 35 <= main_~y~4)) || ((main_~y~4 <= 23 && 23 <= main_~y~4) && main_~x~4 == 22)) || ((14 <= main_~y~4 && main_~x~4 == 13) && main_~y~4 <= 14)) || (((main_~x~4 <= 62 && main_~y~4 <= 37) && 37 <= main_~y~4) && 62 <= main_~x~4)) || ((main_~y~4 <= 3 && main_~x~4 == 2) && 3 <= main_~y~4)) || (((74 <= main_~x~4 && 25 <= main_~y~4) && main_~y~4 <= 25) && main_~x~4 <= 74)) || ((32 <= main_~y~4 && main_~x~4 == 31) && main_~y~4 <= 32)) || (((40 <= main_~y~4 && main_~x~4 <= 59) && main_~y~4 <= 40) && 59 <= main_~x~4)) || (((main_~x~4 <= 91 && 8 <= main_~y~4) && 91 <= main_~x~4) && main_~y~4 <= 8)) || (((main_~x~4 <= 75 && 24 <= main_~y~4) && 75 <= main_~x~4) && main_~y~4 <= 24)) || ((43 <= main_~y~4 && main_~x~4 == 42) && main_~y~4 <= 43)) || (((67 <= main_~x~4 && 32 <= main_~y~4) && main_~y~4 <= 32) && main_~x~4 <= 67)) || (((main_~y~4 <= 3 && 3 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 203.2s OverallTime, 33 OverallIterations, 102 TraceHistogramMax, 111.4s AutomataDifference, 0.0s DeadEndRemovalTime, 47.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 780 SDslu, 13700 SDs, 0 SdLazy, 25450 SolverSat, 1633 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4424 GetRequests, 3371 SyntacticMatches, 2 SemanticMatches, 1051 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4183occurred in iteration=32, 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: 10.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 2602 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 307 NumberOfFragments, 3492 HoareAnnotationTreeSize, 4 FomulaSimplifications, 149626526198 FormulaSimplificationTreeSizeReduction, 11.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 5536186755 FormulaSimplificationTreeSizeReductionInter, 35.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 6902 NumberOfCodeBlocks, 6878 NumberOfCodeBlocksAsserted, 624 NumberOfCheckSat, 6838 ConstructedInterpolants, 0 QuantifiedInterpolants, 3401504 SizeOfPredicates, 33 NumberOfNonLiveVariables, 8181 ConjunctsInSsa, 1019 ConjunctsInUnsatCore, 64 InterpolantComputations, 2 PerfectInterpolantSequences, 106538/193722 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/gr2006.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-55-28-085.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gr2006.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-55-28-085.csv Received shutdown request...