java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:40:38,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:40:38,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:40:38,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:40:38,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:40:38,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:40:38,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:40:38,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:40:38,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:40:38,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:40:38,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:40:38,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:40:38,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:40:38,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:40:38,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:40:38,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:40:38,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:40:38,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:40:38,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:40:39,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:40:39,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:40:39,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:40:39,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:40:39,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:40:39,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:40:39,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:40:39,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:40:39,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:40:39,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:40:39,009 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:40:39,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:40:39,010 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:40:39,011 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:40:39,011 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:40:39,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:40:39,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:40:39,013 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:40:39,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:40:39,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:40:39,026 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:40:39,027 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:40:39,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:40:39,027 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:40:39,027 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:40:39,027 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:40:39,028 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:40:39,028 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:40:39,028 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:40:39,028 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:40:39,028 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:40:39,029 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:40:39,029 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:40:39,029 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:40:39,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:40:39,030 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:40:39,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:40:39,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:40:39,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:40:39,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:40:39,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:40:39,031 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:40:39,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:40:39,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:40:39,032 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:40:39,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:40:39,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:40:39,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:40:39,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:40:39,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:40:39,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:40:39,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:40:39,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:40:39,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:40:39,033 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:40:39,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:40:39,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:40:39,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:40:39,034 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:40:39,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:40:39,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:40:39,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:40:39,082 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:40:39,083 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:40:39,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl [2018-12-03 15:40:39,084 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl' [2018-12-03 15:40:39,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:40:39,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:40:39,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:39,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:40:39,177 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:40:39,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:39,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:40:39,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:40:39,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:40:39,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/1) ... [2018-12-03 15:40:39,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:40:39,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:40:39,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:40:39,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:40:39,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (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-12-03 15:40:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:40:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:40:40,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:40:40,041 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:40:40,041 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:40 BoogieIcfgContainer [2018-12-03 15:40:40,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:40:40,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:40:40,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:40:40,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:40:40,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:39" (1/2) ... [2018-12-03 15:40:40,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba8d793 and model type pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:40:40, skipping insertion in model container [2018-12-03 15:40:40,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:40" (2/2) ... [2018-12-03 15:40:40,050 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl [2018-12-03 15:40:40,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:40:40,069 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:40:40,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:40:40,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:40:40,130 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:40:40,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:40:40,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:40:40,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:40:40,131 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:40:40,131 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:40:40,131 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:40:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 15:40:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:40,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:40,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:40,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:40,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-12-03 15:40:40,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:40,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:40,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:40,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:40,451 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-12-03 15:40:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:40,517 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-03 15:40:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:40,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 15:40:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:40,531 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:40:40,531 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:40:40,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:40:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 15:40:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:40:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-12-03 15:40:40,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-12-03 15:40:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:40,577 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-12-03 15:40:40,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-12-03 15:40:40,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:40,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:40,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:40,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:40,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-12-03 15:40:40,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:40,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:40,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:40,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:40,725 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-12-03 15:40:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:40,766 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-12-03 15:40:40,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:40,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 15:40:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:40,769 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:40:40,770 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:40:40,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:40:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-03 15:40:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:40:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-12-03 15:40:40,794 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-12-03 15:40:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:40,794 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-12-03 15:40:40,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-12-03 15:40:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:40,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:40,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:40,799 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:40,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-12-03 15:40:40,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:40,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:40,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:40,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:40,893 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-12-03 15:40:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:40,954 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-12-03 15:40:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:40,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 15:40:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:40,959 INFO L225 Difference]: With dead ends: 187 [2018-12-03 15:40:40,960 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 15:40:40,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 15:40:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-12-03 15:40:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:40:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-12-03 15:40:41,016 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-12-03 15:40:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:41,016 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-12-03 15:40:41,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-12-03 15:40:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:41,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:41,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:41,020 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:41,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-12-03 15:40:41,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:41,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:41,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:41,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:41,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:41,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:41,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:41,167 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-12-03 15:40:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:41,233 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-12-03 15:40:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:41,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 15:40:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:41,239 INFO L225 Difference]: With dead ends: 367 [2018-12-03 15:40:41,240 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 15:40:41,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 15:40:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-12-03 15:40:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 15:40:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-12-03 15:40:41,297 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-12-03 15:40:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-12-03 15:40:41,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-12-03 15:40:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:41,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:41,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:41,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:41,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-12-03 15:40:41,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:41,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:41,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:41,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:41,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:40:41,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:41,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:40:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:40:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:40:41,490 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-12-03 15:40:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:41,767 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-12-03 15:40:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:40:41,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 15:40:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:41,771 INFO L225 Difference]: With dead ends: 517 [2018-12-03 15:40:41,771 INFO L226 Difference]: Without dead ends: 515 [2018-12-03 15:40:41,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:40:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-03 15:40:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-12-03 15:40:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 15:40:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-12-03 15:40:41,840 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-12-03 15:40:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:41,841 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-12-03 15:40:41,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:40:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-12-03 15:40:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:41,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:41,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:41,842 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:41,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-12-03 15:40:41,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:41,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:41,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:42,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:42,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:42,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:42,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:40:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:40:42,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:40:42,095 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-12-03 15:40:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:42,432 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2018-12-03 15:40:42,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:40:42,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 15:40:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:42,436 INFO L225 Difference]: With dead ends: 879 [2018-12-03 15:40:42,437 INFO L226 Difference]: Without dead ends: 605 [2018-12-03 15:40:42,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:40:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-03 15:40:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2018-12-03 15:40:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-12-03 15:40:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions. [2018-12-03 15:40:42,550 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17 [2018-12-03 15:40:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:42,550 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 776 transitions. [2018-12-03 15:40:42,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:40:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions. [2018-12-03 15:40:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:40:42,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:42,556 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:40:42,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:42,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times [2018-12-03 15:40:42,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:42,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:42,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:42,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:42,887 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:40:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:40:42,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:42,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:42,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:42,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:42,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:42,898 INFO L87 Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states. [2018-12-03 15:40:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:43,199 INFO L93 Difference]: Finished difference Result 1809 states and 2322 transitions. [2018-12-03 15:40:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:43,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-03 15:40:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:43,212 INFO L225 Difference]: With dead ends: 1809 [2018-12-03 15:40:43,212 INFO L226 Difference]: Without dead ends: 1207 [2018-12-03 15:40:43,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-12-03 15:40:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-12-03 15:40:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-12-03 15:40:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-12-03 15:40:43,431 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62 [2018-12-03 15:40:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:43,432 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-12-03 15:40:43,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-12-03 15:40:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:40:43,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:43,443 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:40:43,444 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:43,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times [2018-12-03 15:40:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:43,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:43,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:43,859 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 15:40:44,069 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 15:40:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 15:40:44,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:44,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:44,156 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-03 15:40:44,158 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [52], [54], [56], [60], [62], [64] [2018-12-03 15:40:44,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:40:44,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:40:45,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:40:45,553 INFO L272 AbstractInterpreter]: Visited 25 different actions 130 times. Merged at 21 different actions 72 times. Never widened. Found 29 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:40:45,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:45,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:40:45,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:45,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:45,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:45,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:45,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:46,154 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 15:40:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 15:40:46,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:46,703 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 15:40:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-03 15:40:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:46,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:40:46,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:46,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:40:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:40:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:40:46,748 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 7 states. [2018-12-03 15:40:47,544 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 15:40:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:47,922 INFO L93 Difference]: Finished difference Result 1889 states and 2370 transitions. [2018-12-03 15:40:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:40:47,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-12-03 15:40:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:47,928 INFO L225 Difference]: With dead ends: 1889 [2018-12-03 15:40:47,929 INFO L226 Difference]: Without dead ends: 991 [2018-12-03 15:40:47,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:40:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-12-03 15:40:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 725. [2018-12-03 15:40:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-03 15:40:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 892 transitions. [2018-12-03 15:40:48,091 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 892 transitions. Word has length 62 [2018-12-03 15:40:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:48,092 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 892 transitions. [2018-12-03 15:40:48,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:40:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 892 transitions. [2018-12-03 15:40:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:40:48,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:48,094 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:40:48,095 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:48,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1342683145, now seen corresponding path program 2 times [2018-12-03 15:40:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:48,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:48,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-03 15:40:48,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:48,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:48,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:48,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:48,311 INFO L87 Difference]: Start difference. First operand 725 states and 892 transitions. Second operand 3 states. [2018-12-03 15:40:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:48,360 INFO L93 Difference]: Finished difference Result 749 states and 917 transitions. [2018-12-03 15:40:48,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:48,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-03 15:40:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:48,361 INFO L225 Difference]: With dead ends: 749 [2018-12-03 15:40:48,362 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:40:48,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:40:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:40:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:40:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:40:48,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-12-03 15:40:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:48,365 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:40:48,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:40:48,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:40:48,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:40:48,714 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-03 15:40:49,109 INFO L444 ceAbstractionStarter]: At program point L320(lines 313 321) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,110 INFO L444 ceAbstractionStarter]: At program point L411(lines 407 418) the Hoare annotation is: (and (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,110 INFO L444 ceAbstractionStarter]: At program point L279(lines 279 291) the Hoare annotation is: (let ((.cse1 (div ~mode1 256)) (.cse0 (<= 0 ~send5)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 (= ~mode1 (* 256 .cse1)) (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and (<= .cse1 0) .cse0 (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse5 (mod v_prenex_1 256))) (and (= .cse5 ~p5_old) (<= .cse5 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4))) [2018-12-03 15:40:49,110 INFO L444 ceAbstractionStarter]: At program point L432(lines 432 439) the Hoare annotation is: (and (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~107) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,111 INFO L444 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 444) no Hoare annotation was computed. [2018-12-03 15:40:49,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 444) no Hoare annotation was computed. [2018-12-03 15:40:49,111 INFO L444 ceAbstractionStarter]: At program point L441(lines 272 441) the Hoare annotation is: (let ((.cse1 (div ~mode1 256)) (.cse0 (<= 0 ~send5)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (<= ~r1 (* 256 (div ~r1 256)))) (.cse4 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 (= ~mode1 (* 256 .cse1)) (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and (<= .cse1 0) .cse0 (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse5 (mod v_prenex_1 256))) (and (= .cse5 ~p5_old) (<= .cse5 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4))) [2018-12-03 15:40:49,111 INFO L444 ceAbstractionStarter]: At program point L342(lines 334 343) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 444) no Hoare annotation was computed. [2018-12-03 15:40:49,111 INFO L444 ceAbstractionStarter]: At program point L347(lines 347 357) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,111 INFO L444 ceAbstractionStarter]: At program point L438(lines 438 442) the Hoare annotation is: false [2018-12-03 15:40:49,112 INFO L444 ceAbstractionStarter]: At program point L364(lines 356 365) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,112 INFO L444 ceAbstractionStarter]: At program point L298(lines 290 299) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,112 INFO L444 ceAbstractionStarter]: At program point L422(lines 417 423) the Hoare annotation is: (and (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,112 INFO L444 ceAbstractionStarter]: At program point L402(lines 402 408) the Hoare annotation is: (and (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,112 INFO L444 ceAbstractionStarter]: At program point L369(lines 369 379) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,113 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 314) the Hoare annotation is: (and (= ~mode5 (* 256 (div ~mode5 256))) (<= (div ~mode1 256) 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127)) [2018-12-03 15:40:49,113 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443) no Hoare annotation was computed. [2018-12-03 15:40:49,113 INFO L444 ceAbstractionStarter]: At program point L386(lines 378 387) the Hoare annotation is: (and (<= (div ~mode1 256) 0) (<= 0 ~send5) (<= 1 ~mode1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p5_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~send5 127)) [2018-12-03 15:40:49,133 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:40:49 BoogieIcfgContainer [2018-12-03 15:40:49,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:40:49,134 INFO L168 Benchmark]: Toolchain (without parser) took 9958.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -211.3 MB). Peak memory consumption was 498.0 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:49,135 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:40:49,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:40:49,136 INFO L168 Benchmark]: Boogie Preprocessor took 46.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:40:49,137 INFO L168 Benchmark]: RCFGBuilder took 774.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:49,138 INFO L168 Benchmark]: TraceAbstraction took 9090.52 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -253.6 MB). Peak memory consumption was 455.8 MB. Max. memory is 7.1 GB. [2018-12-03 15:40:49,142 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 774.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9090.52 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -253.6 MB). Peak memory consumption was 455.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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: 303]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) || ((((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: (((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) || ((((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: ((((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 407]: Loop Invariant Derived loop invariant: (((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((((((~mode1 / 256 <= 0 && 0 <= ~send5) && 1 <= ~mode1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode1 / 256 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 196 SDslu, 218 SDs, 0 SdLazy, 126 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 516 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 740 HoareAnnotationTreeSize, 16 FomulaSimplifications, 947 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 416 ConstructedInterpolants, 7 QuantifiedInterpolants, 83851 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 504/510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...