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/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:54:17,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:54:17,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:54:17,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:54:17,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:54:17,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:54:17,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:54:17,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:54:17,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:54:17,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:54:17,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:54:17,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:54:17,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:54:17,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:54:17,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:54:17,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:54:17,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:54:17,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:54:17,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:54:17,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:54:17,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:54:17,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:54:17,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:54:17,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:54:17,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:54:17,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:54:17,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:54:17,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:54:17,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:54:17,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:54:17,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:54:17,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:54:17,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:54:17,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:54:17,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:54:17,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:54:17,889 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-09-26 21:54:17,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:54:17,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:54:17,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:54:17,910 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:54:17,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:54:17,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:54:17,911 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:54:17,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:54:17,912 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:54:17,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:54:17,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:54:17,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:54:17,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:54:17,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:54:17,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:54:17,913 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:54:17,913 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:54:17,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:54:17,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:54:17,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:54:17,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:54:17,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:54:17,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:54:17,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:54:17,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:54:17,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:54:17,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:54:17,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:54:17,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:54:17,916 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:54:17,916 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:54:17,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:54:17,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:54:17,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:54:17,991 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:54:17,992 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:54:17,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-09-26 21:54:17,993 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-09-26 21:54:18,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:54:18,086 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:54:18,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:54:18,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:54:18,088 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:54:18,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:54:18,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:54:18,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:54:18,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:54:18,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... [2018-09-26 21:54:18,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:54:18,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:54:18,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:54:18,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:54:18,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:54:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:54:18,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:54:18,959 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:54:18,959 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:54:18 BoogieIcfgContainer [2018-09-26 21:54:18,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:54:18,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:54:18,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:54:18,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:54:18,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:54:18" (1/2) ... [2018-09-26 21:54:18,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab00364 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:54:18, skipping insertion in model container [2018-09-26 21:54:18,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:54:18" (2/2) ... [2018-09-26 21:54:18,968 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-09-26 21:54:18,978 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:54:18,987 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:54:19,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:54:19,043 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:54:19,043 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:54:19,043 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:54:19,044 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:54:19,044 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:54:19,044 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:54:19,044 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:54:19,044 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:54:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-26 21:54:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:54:19,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:19,070 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:19,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:19,080 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-09-26 21:54:19,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:19,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:19,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:19,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:19,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:19,308 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-09-26 21:54:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:19,520 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-09-26 21:54:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:19,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 21:54:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:19,538 INFO L225 Difference]: With dead ends: 82 [2018-09-26 21:54:19,538 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 21:54:19,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 21:54:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 21:54:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 21:54:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-09-26 21:54:19,589 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-09-26 21:54:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:19,590 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-09-26 21:54:19,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-09-26 21:54:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:54:19,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:19,592 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:19,592 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:19,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-09-26 21:54:19,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:19,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:19,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:19,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:19,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:19,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:19,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:19,665 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-09-26 21:54:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:19,923 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-09-26 21:54:19,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:19,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:54:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:19,925 INFO L225 Difference]: With dead ends: 98 [2018-09-26 21:54:19,925 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 21:54:19,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 21:54:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 21:54:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:54:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-09-26 21:54:19,938 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-09-26 21:54:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:19,938 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-09-26 21:54:19,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-09-26 21:54:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:54:19,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:19,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:19,941 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:19,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-09-26 21:54:19,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:19,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:19,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:20,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:20,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:20,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:20,028 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:20,028 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-09-26 21:54:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:20,103 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-09-26 21:54:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:20,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-26 21:54:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:20,106 INFO L225 Difference]: With dead ends: 105 [2018-09-26 21:54:20,106 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 21:54:20,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 21:54:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 21:54:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:54:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-09-26 21:54:20,118 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-09-26 21:54:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:20,119 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-09-26 21:54:20,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-09-26 21:54:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:54:20,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:20,121 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:20,121 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:20,121 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-09-26 21:54:20,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:20,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:20,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:20,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:20,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:20,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:20,180 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-09-26 21:54:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:20,354 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-09-26 21:54:20,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:20,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-09-26 21:54:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:20,356 INFO L225 Difference]: With dead ends: 122 [2018-09-26 21:54:20,356 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 21:54:20,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 21:54:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 21:54:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 21:54:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-09-26 21:54:20,385 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-09-26 21:54:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:20,386 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-09-26 21:54:20,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-09-26 21:54:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:54:20,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:20,387 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:20,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:20,391 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-09-26 21:54:20,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:20,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:20,497 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:20,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:20,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:20,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:20,498 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-09-26 21:54:20,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:20,660 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-09-26 21:54:20,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:20,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-26 21:54:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:20,662 INFO L225 Difference]: With dead ends: 145 [2018-09-26 21:54:20,662 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 21:54:20,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 21:54:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 21:54:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 21:54:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-09-26 21:54:20,678 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-09-26 21:54:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:20,679 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-09-26 21:54:20,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-09-26 21:54:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:54:20,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:20,680 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:20,681 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:20,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-09-26 21:54:20,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:20,731 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:20,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:20,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:20,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:20,732 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-09-26 21:54:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:20,892 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-09-26 21:54:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:20,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-26 21:54:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:20,895 INFO L225 Difference]: With dead ends: 235 [2018-09-26 21:54:20,895 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 21:54:20,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 21:54:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-09-26 21:54:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 21:54:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-09-26 21:54:20,921 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-09-26 21:54:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:20,921 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-09-26 21:54:20,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-09-26 21:54:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:54:20,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:20,924 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:20,924 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:20,924 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-09-26 21:54:20,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 21:54:21,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:21,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:21,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:21,028 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:21,029 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-09-26 21:54:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:21,222 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-09-26 21:54:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:21,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-26 21:54:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:21,224 INFO L225 Difference]: With dead ends: 288 [2018-09-26 21:54:21,225 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 21:54:21,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 21:54:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 21:54:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 21:54:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-09-26 21:54:21,273 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-09-26 21:54:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:21,274 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-09-26 21:54:21,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-09-26 21:54:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:54:21,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:21,282 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:21,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:21,286 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-09-26 21:54:21,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:21,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:21,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 21:54:21,399 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:21,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:21,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:21,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:21,400 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-09-26 21:54:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:21,621 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-09-26 21:54:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:21,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-26 21:54:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:21,625 INFO L225 Difference]: With dead ends: 312 [2018-09-26 21:54:21,626 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 21:54:21,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 21:54:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 21:54:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 21:54:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-09-26 21:54:21,661 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-09-26 21:54:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:21,661 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-09-26 21:54:21,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-09-26 21:54:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:54:21,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:21,664 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:21,664 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:21,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-09-26 21:54:21,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:54:21,780 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:21,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:21,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:21,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:21,781 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-09-26 21:54:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:22,040 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-09-26 21:54:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:22,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-26 21:54:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:22,043 INFO L225 Difference]: With dead ends: 345 [2018-09-26 21:54:22,043 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 21:54:22,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 21:54:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-09-26 21:54:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 21:54:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-09-26 21:54:22,064 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-09-26 21:54:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:22,064 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-09-26 21:54:22,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-09-26 21:54:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:54:22,066 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:22,066 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:22,066 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:22,066 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-09-26 21:54:22,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:22,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:54:22,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:22,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:22,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:22,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:22,192 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-09-26 21:54:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:22,420 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-09-26 21:54:22,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:22,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-26 21:54:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:22,422 INFO L225 Difference]: With dead ends: 335 [2018-09-26 21:54:22,422 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 21:54:22,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 21:54:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-09-26 21:54:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 21:54:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-09-26 21:54:22,442 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-09-26 21:54:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:22,443 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-09-26 21:54:22,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-09-26 21:54:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:54:22,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:22,444 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:22,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:22,445 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-09-26 21:54:22,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:22,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:22,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:54:22,577 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:54:22,577 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:54:22,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:22,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:54:23,485 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:54:23,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-09-26 21:54:23,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:54:23,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:54:23,487 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:23,487 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 5 states. [2018-09-26 21:54:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:24,162 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2018-09-26 21:54:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:54:24,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-09-26 21:54:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:24,170 INFO L225 Difference]: With dead ends: 451 [2018-09-26 21:54:24,170 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 21:54:24,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 21:54:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-09-26 21:54:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-26 21:54:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2018-09-26 21:54:24,218 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 52 [2018-09-26 21:54:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:24,218 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2018-09-26 21:54:24,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:54:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-09-26 21:54:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:54:24,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:24,220 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:24,220 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:24,221 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash -784981334, now seen corresponding path program 1 times [2018-09-26 21:54:24,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:24,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:24,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 21:54:24,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:24,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:24,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:24,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:24,376 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:24,376 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand 3 states. [2018-09-26 21:54:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:24,721 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2018-09-26 21:54:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:24,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-26 21:54:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:24,725 INFO L225 Difference]: With dead ends: 726 [2018-09-26 21:54:24,725 INFO L226 Difference]: Without dead ends: 486 [2018-09-26 21:54:24,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-09-26 21:54:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2018-09-26 21:54:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-09-26 21:54:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2018-09-26 21:54:24,806 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 52 [2018-09-26 21:54:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:24,806 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2018-09-26 21:54:24,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2018-09-26 21:54:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:54:24,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:24,808 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:24,808 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:24,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:24,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1664618796, now seen corresponding path program 1 times [2018-09-26 21:54:24,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:24,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:24,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:24,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:24,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-26 21:54:24,899 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:24,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:24,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:24,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:24,900 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 3 states. [2018-09-26 21:54:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:25,447 INFO L93 Difference]: Finished difference Result 782 states and 1089 transitions. [2018-09-26 21:54:25,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:25,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-26 21:54:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:25,450 INFO L225 Difference]: With dead ends: 782 [2018-09-26 21:54:25,451 INFO L226 Difference]: Without dead ends: 404 [2018-09-26 21:54:25,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-09-26 21:54:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-09-26 21:54:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-09-26 21:54:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2018-09-26 21:54:25,517 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 52 [2018-09-26 21:54:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:25,517 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2018-09-26 21:54:25,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2018-09-26 21:54:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 21:54:25,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:25,519 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:25,519 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:25,519 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash -232860399, now seen corresponding path program 1 times [2018-09-26 21:54:25,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:25,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-26 21:54:25,596 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:25,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:54:25,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:25,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:25,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:25,597 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand 3 states. [2018-09-26 21:54:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:26,239 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-09-26 21:54:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:26,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-09-26 21:54:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:26,241 INFO L225 Difference]: With dead ends: 581 [2018-09-26 21:54:26,241 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 21:54:26,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 21:54:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2018-09-26 21:54:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 21:54:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-09-26 21:54:26,298 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 61 [2018-09-26 21:54:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:26,299 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-09-26 21:54:26,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-09-26 21:54:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 21:54:26,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:26,301 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:26,301 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:26,302 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-09-26 21:54:26,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:26,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:26,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:26,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 21:54:26,417 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:26,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:26,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:26,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:26,418 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:26,418 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 3 states. [2018-09-26 21:54:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:27,049 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2018-09-26 21:54:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:27,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-09-26 21:54:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:27,052 INFO L225 Difference]: With dead ends: 430 [2018-09-26 21:54:27,052 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 21:54:27,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 21:54:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-09-26 21:54:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 21:54:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-09-26 21:54:27,100 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 75 [2018-09-26 21:54:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:27,101 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-09-26 21:54:27,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-09-26 21:54:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 21:54:27,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:27,102 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:27,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:27,103 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-09-26 21:54:27,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:27,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-26 21:54:27,825 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:54:27,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:54:27,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:27,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-26 21:54:29,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:54:29,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-26 21:54:29,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:54:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:54:29,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:29,148 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2018-09-26 21:54:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:31,687 INFO L93 Difference]: Finished difference Result 1096 states and 1350 transitions. [2018-09-26 21:54:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:54:31,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-09-26 21:54:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:31,692 INFO L225 Difference]: With dead ends: 1096 [2018-09-26 21:54:31,692 INFO L226 Difference]: Without dead ends: 840 [2018-09-26 21:54:31,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-09-26 21:54:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 457. [2018-09-26 21:54:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-09-26 21:54:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2018-09-26 21:54:31,775 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 75 [2018-09-26 21:54:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:31,775 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2018-09-26 21:54:31,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:54:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2018-09-26 21:54:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 21:54:31,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:31,777 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:31,777 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:31,777 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash 44732949, now seen corresponding path program 1 times [2018-09-26 21:54:31,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:31,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:31,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-26 21:54:31,860 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:54:31,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:54:31,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:54:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:54:31,861 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:31,861 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 3 states. [2018-09-26 21:54:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:32,113 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-09-26 21:54:32,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:54:32,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-09-26 21:54:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:32,115 INFO L225 Difference]: With dead ends: 702 [2018-09-26 21:54:32,115 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 21:54:32,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 21:54:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-09-26 21:54:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 21:54:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2018-09-26 21:54:32,160 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 82 [2018-09-26 21:54:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:32,160 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2018-09-26 21:54:32,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:54:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2018-09-26 21:54:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 21:54:32,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:32,161 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:32,162 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:32,162 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 2 times [2018-09-26 21:54:32,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:32,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:32,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:54:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-26 21:54:32,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:54:32,325 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:54:32,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:54:32,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:54:32,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:54:32,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-26 21:54:32,519 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:54:32,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-26 21:54:32,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:54:32,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:54:32,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:32,520 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand 5 states. [2018-09-26 21:54:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:32,644 INFO L93 Difference]: Finished difference Result 491 states and 600 transitions. [2018-09-26 21:54:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:54:32,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-09-26 21:54:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:32,646 INFO L225 Difference]: With dead ends: 491 [2018-09-26 21:54:32,646 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 21:54:32,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 21:54:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-09-26 21:54:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-26 21:54:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2018-09-26 21:54:32,688 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 102 [2018-09-26 21:54:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:32,688 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-09-26 21:54:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:54:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2018-09-26 21:54:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 21:54:32,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:54:32,690 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:54:32,690 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:54:32,690 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:54:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2108568021, now seen corresponding path program 3 times [2018-09-26 21:54:32,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:54:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:54:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:32,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:54:32,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:54:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:54:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-26 21:54:32,889 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:54:32,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:54:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:54:32,994 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-26 21:54:32,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:54:33,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:54:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-09-26 21:54:33,206 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:54:33,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-09-26 21:54:33,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:54:33,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:54:33,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:54:33,208 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand 4 states. [2018-09-26 21:54:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:54:33,457 INFO L93 Difference]: Finished difference Result 322 states and 376 transitions. [2018-09-26 21:54:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:54:33,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-09-26 21:54:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:54:33,458 INFO L225 Difference]: With dead ends: 322 [2018-09-26 21:54:33,458 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:54:33,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:54:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:54:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:54:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:54:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:54:33,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2018-09-26 21:54:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:54:33,460 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:54:33,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:54:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:54:33,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:54:33,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:54:33,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:33,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:33,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:33,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:33,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:33,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:34,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:54:35,594 WARN L178 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-09-26 21:54:35,954 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-09-26 21:54:36,233 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-09-26 21:54:36,797 WARN L178 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-09-26 21:54:37,248 WARN L178 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-09-26 21:54:37,794 WARN L178 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-09-26 21:54:38,140 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-09-26 21:54:38,544 WARN L178 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-09-26 21:54:38,678 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-09-26 21:54:38,811 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-09-26 21:54:39,038 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-09-26 21:54:39,342 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-09-26 21:54:39,559 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-09-26 21:54:39,761 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-09-26 21:54:39,912 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-09-26 21:54:40,299 WARN L178 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-09-26 21:54:40,518 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-09-26 21:54:40,764 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-09-26 21:54:41,087 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-09-26 21:54:41,396 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-09-26 21:54:41,921 WARN L178 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-09-26 21:54:42,384 WARN L178 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-09-26 21:54:42,810 WARN L178 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-09-26 21:54:43,135 WARN L178 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-09-26 21:54:43,276 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-09-26 21:54:43,822 WARN L178 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2018-09-26 21:54:44,535 WARN L178 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-09-26 21:54:44,762 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-09-26 21:54:44,767 INFO L422 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse16 (+ ~t_b 2))) (let ((.cse5 (<= ~c_t .cse16)) (.cse6 (<= 1 ~c1_pc)) (.cse7 (<= ~c .cse16)) (.cse0 (<= 2 ~r_st)) (.cse8 (<= .cse16 ~c_t)) (.cse9 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse11 (<= .cse16 ~c)) (.cse1 (not (= ~e_c 1))) (.cse12 (= ~wb_pc 1)) (.cse13 (<= ~data .cse16)) (.cse2 (<= 2 ~e_wl)) (.cse3 (= ~wl_st 0)) (.cse14 (<= 2 ~c1_st)) (.cse15 (<= .cse16 ~data)) (.cse4 (not (= ~e_c 0)))) (or (and .cse0 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4) (and .cse5 .cse6 (<= 2 ~wl_st) .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse13 .cse2 .cse14 .cse15 .cse4) (and .cse14 (and (= ~wl_pc 1) .cse1 .cse12 .cse6 .cse2 .cse3 .cse0 .cse9 .cse4) .cse10) (and .cse5 .cse6 .cse7 .cse0 .cse8 (<= ~d .cse16) .cse9 .cse10 .cse11 (<= .cse16 ~d) .cse1 .cse12 .cse13 .cse2 .cse3 .cse14 .cse15 .cse4)))) [2018-09-26 21:54:44,767 INFO L422 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse3 (<= 2 ~wl_st)) (.cse10 (<= 2 ~c1_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~e_wl)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0))) (.cse8 (<= 2 ~c2_st))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse2 .cse3 (<= ~c .cse7) (<= .cse7 ~c_t) .cse5 .cse8 (<= .cse7 ~c) .cse0 .cse1 (<= ~data .cse7) .cse9 .cse10 (<= .cse7 ~data) .cse6)) (and .cse10 (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse9 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse8))) [2018-09-26 21:54:44,767 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse9 (+ ~t_b 2))) (let ((.cse0 (not (= ~e_c 1))) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse10 (<= ~c .cse9)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse11 (<= .cse9 ~c)) (.cse1 (= ~wb_pc 1)) (.cse12 (<= ~data .cse9)) (.cse13 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse14 (<= .cse9 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse8 (= ~e_wl 1)) (and (<= ~c_t .cse9) .cse2 .cse3 .cse10 (<= .cse9 ~c_t) .cse5 .cse8 .cse11 .cse0 .cse1 .cse12 .cse13 .cse7 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse4 .cse5 .cse8 .cse11 (<= ~c_t ~c) .cse1 .cse12 .cse13 (< ~c (+ ~c_t 1)) .cse7 .cse14 .cse6)))) [2018-09-26 21:54:44,768 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-09-26 21:54:44,768 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-09-26 21:54:44,768 INFO L422 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse9 (+ ~t_b 2))) (let ((.cse0 (not (= ~e_c 1))) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse10 (<= ~c .cse9)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse11 (<= .cse9 ~c)) (.cse1 (= ~wb_pc 1)) (.cse12 (<= ~data .cse9)) (.cse13 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse14 (<= .cse9 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse8 (= ~e_wl 1)) (and (<= ~c_t .cse9) .cse2 .cse3 .cse10 (<= .cse9 ~c_t) .cse5 .cse8 .cse11 .cse0 .cse1 .cse12 .cse13 .cse7 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse4 .cse5 .cse8 .cse11 (<= ~c_t ~c) .cse1 .cse12 .cse13 (< ~c (+ ~c_t 1)) .cse7 .cse14 .cse6)))) [2018-09-26 21:54:44,768 INFO L422 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2)) (.cse6 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse5 (<= 1 ~c1_pc)) (.cse15 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0)))) (let ((.cse2 (or (and .cse10 .cse11 .cse5 .cse6 .cse15 .cse8 .cse14) (and .cse10 .cse11 (= ~wl_pc 1) .cse5 .cse15 .cse8 .cse14))) (.cse7 (<= ~c .cse4)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse4 ~c)) (.cse12 (<= ~data .cse4)) (.cse3 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse4 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (= ~wl_pc 0) (and (<= ~c_t .cse4) .cse5 .cse6 .cse7 (<= .cse4 ~c_t) .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse15 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse11 .cse12 .cse3 (< ~c (+ ~c_t 1)) .cse0 .cse13 .cse14)))) [2018-09-26 21:54:44,768 INFO L422 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2)) (.cse6 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse5 (<= 1 ~c1_pc)) (.cse15 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse10 .cse11 .cse5 .cse6 .cse15 .cse8 .cse14) (and .cse10 .cse11 (= ~wl_pc 1) .cse5 .cse15 .cse8 .cse14))) (.cse7 (<= ~c .cse4)) (.cse3 (<= 2 ~c2_st)) (.cse9 (<= .cse4 ~c)) (.cse12 (<= ~data .cse4)) (.cse0 (<= 2 ~e_wl)) (.cse2 (<= 2 ~c1_st)) (.cse13 (<= .cse4 ~data))) (or (and .cse0 .cse1) (and .cse1 .cse2 .cse3) (= ~wl_pc 0) (and (<= ~c_t .cse4) .cse5 .cse6 .cse7 (<= .cse4 ~c_t) .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse0 .cse2 .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse15 .cse8 .cse3 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse0 (< ~c (+ ~c_t 1)) .cse2 .cse13)))) [2018-09-26 21:54:44,769 INFO L422 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse1 (<= 2 ~wl_st)) (.cse6 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 1))) (.cse5 (= ~wb_pc 1)) (.cse0 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~r_st)) (.cse3 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0))) (.cse4 (<= 2 ~c2_st))) (or (let ((.cse2 (+ ~t_b 2))) (and .cse0 .cse1 (<= ~c .cse2) .cse3 .cse4 (<= .cse2 ~c) (<= ~c_t ~c) .cse5 (<= ~data .cse2) (<= 2 ~e_wl) (< ~c (+ ~c_t 1)) .cse6 (<= .cse2 ~data) .cse7)) (and .cse8 .cse5 .cse0 .cse1 .cse9 .cse3 .cse7) (and .cse6 (and (= ~wl_pc 1) .cse8 .cse5 .cse0 (= ~wl_st 0) .cse9 .cse3 .cse7) .cse4 (= ~e_wl 1)))) [2018-09-26 21:54:44,769 INFO L422 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse20 (+ ~t_b 2))) (let ((.cse5 (< ~c (+ ~c_t 1))) (.cse1 (<= ~c_t ~c)) (.cse9 (<= 2 ~wl_st)) (.cse17 (= ~wl_pc 1)) (.cse7 (<= ~c_t .cse20)) (.cse8 (<= 1 ~c1_pc)) (.cse18 (<= ~c .cse20)) (.cse0 (<= 2 ~r_st)) (.cse10 (<= .cse20 ~c_t)) (.cse11 (<= 1 ~c2_pc)) (.cse12 (<= 2 ~c2_st)) (.cse19 (<= .cse20 ~c)) (.cse2 (not (= ~e_c 1))) (.cse13 (= ~wb_pc 1)) (.cse14 (<= ~data .cse20)) (.cse3 (<= 2 ~e_wl)) (.cse4 (= ~wl_st 0)) (.cse15 (<= 2 ~c1_st)) (.cse16 (<= .cse20 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse1 (= ~c2_st 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse3 .cse15 .cse16 .cse6) (and (and .cse17 .cse2 .cse13 .cse8 .cse9 .cse5 .cse0 .cse11 .cse6 .cse1) .cse15 .cse12) (and .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse19 .cse2 .cse13 .cse14 .cse3 .cse15 .cse16 .cse6) (and .cse15 (and .cse17 .cse2 .cse13 .cse8 .cse3 .cse4 .cse0 .cse11 .cse6) .cse12) (and .cse7 .cse8 .cse18 .cse0 .cse10 (<= ~d .cse20) .cse11 .cse12 .cse19 (<= .cse20 ~d) .cse2 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse6)))) [2018-09-26 21:54:44,769 INFO L422 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse4 (not (= ~e_c 1))) (.cse5 (<= 2 ~c1_st)) (.cse6 (not (= ~c2_st 0))) (.cse7 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse4 (< ~c (+ ~c_t 1)) .cse5 .cse6 .cse7) (let ((.cse8 (+ ~t_b 2))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4 (= ~wb_pc 1) (<= ~data .cse8) (<= 2 ~e_wl) .cse5 .cse6 .cse7 (<= .cse8 ~data))))) [2018-09-26 21:54:44,769 INFO L422 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse12 (+ ~t_b 2))) (let ((.cse5 (= ~wl_pc 1)) (.cse9 (<= ~c_t .cse12)) (.cse10 (<= ~c .cse12)) (.cse11 (<= .cse12 ~c_t)) (.cse14 (<= 2 ~c2_st)) (.cse15 (<= .cse12 ~c)) (.cse17 (<= ~data .cse12)) (.cse18 (<= .cse12 ~data)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse13 (<= 1 ~c2_pc)) (.cse4 (= ~c2_st 0)) (.cse6 (not (= ~e_c 1))) (.cse16 (= ~wb_pc 1)) (.cse19 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse11 (<= ~d .cse12) .cse13 .cse14 .cse15 (<= .cse12 ~d) .cse5 .cse6 .cse16 .cse17 .cse7 .cse18 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse11 .cse13 .cse14 .cse15 .cse6 .cse16 .cse17 .cse19 .cse7 .cse18 .cse8) (let ((.cse20 (+ ~t_b 1))) (and .cse0 .cse1 .cse2 .cse3 .cse13 (<= ~data .cse20) .cse4 .cse6 .cse16 .cse19 .cse7 .cse8 (<= .cse20 ~data)))))) [2018-09-26 21:54:44,769 INFO L422 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse6 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse0 (<= ~c_t .cse6)) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= ~c .cse6)) (.cse5 (<= .cse6 ~c_t)) (.cse7 (<= 1 ~c2_pc)) (.cse15 (<= 2 ~c2_st)) (.cse8 (<= .cse6 ~c)) (.cse10 (not (= ~e_c 1))) (.cse16 (= ~wb_pc 1)) (.cse11 (<= ~data .cse6)) (.cse17 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse13 (<= .cse6 ~data)) (.cse12 (not (= ~e_c 0)))) (or (and (let ((.cse9 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse9 .cse10 .cse1 .cse2 .cse4 (< ~c (+ ~c_t 1)) (<= ~t_b ~data) .cse7 (<= ~data ~t_b) .cse12 (= ~wb_pc 0) (<= ~c_t ~c)))) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse10 .cse16 .cse11 .cse17 .cse14 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse15 .cse8 .cse10 .cse16 .cse11 .cse17 .cse14 .cse13 .cse12)))) [2018-09-26 21:54:44,770 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-09-26 21:54:44,770 INFO L422 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (and (<= 2 ~c1_st) (let ((.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~e_wl)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= .cse0 ~d) .cse1 .cse2 .cse3 .cse4 (<= ~c .cse0) .cse5 (<= ~d .cse0) .cse6 (<= .cse0 ~c) .cse7)) (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (<= 2 ~c2_st)) [2018-09-26 21:54:44,770 INFO L422 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse7 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse5 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse6 (= ~wb_pc 1)) (.cse2 (<= 2 ~e_wl)) (.cse4 (<= 2 ~c1_st)) (.cse3 (not (= ~e_c 0)))) (or (and .cse0 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse1 .cse2 (< ~c (+ ~c_t 1)) .cse3) (and .cse4 .cse5 (and (= ~wl_pc 1) .cse1 .cse6 .cse7 .cse2 .cse0 .cse8 .cse3)) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse7 (<= ~c .cse9) .cse0 (<= .cse9 ~c_t) (<= ~d .cse9) .cse8 .cse5 (<= .cse9 ~c) (<= .cse9 ~d) .cse1 .cse6 (<= ~data .cse9) .cse2 .cse4 (<= .cse9 ~data) .cse3)))) [2018-09-26 21:54:44,770 INFO L422 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-09-26 21:54:44,770 INFO L422 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse10 (<= 2 ~c1_st)) (.cse1 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse6 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~e_wl)) (.cse3 (= ~wl_st 0)) (.cse0 (<= 2 ~r_st)) (.cse7 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse8 (<= 2 ~c2_st))) (or (and .cse0 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4) (let ((.cse5 (+ ~t_b 2))) (and (<= ~c_t .cse5) .cse6 (<= 2 ~wl_st) (<= ~c .cse5) (<= .cse5 ~c_t) .cse7 .cse8 (<= .cse5 ~c) .cse1 .cse9 (<= ~data .cse5) .cse2 .cse10 (<= .cse5 ~data) .cse4)) (and .cse10 (and (= ~wl_pc 1) .cse1 .cse9 .cse6 .cse2 .cse3 .cse0 .cse7 .cse4) .cse8))) [2018-09-26 21:54:44,771 INFO L422 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2))) (let ((.cse12 (<= ~c_t .cse15)) (.cse13 (<= ~c .cse15)) (.cse14 (<= .cse15 ~c_t)) (.cse16 (<= .cse15 ~c)) (.cse1 (= ~wb_pc 1)) (.cse2 (<= ~data .cse15)) (.cse4 (<= 2 ~e_wl)) (.cse10 (<= .cse15 ~data)) (.cse3 (<= 1 ~c1_pc)) (.cse5 (<= 2 ~wl_st)) (.cse6 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse17 (= ~wl_pc 1)) (.cse0 (not (= ~e_c 1))) (.cse7 (<= 2 ~c1_st)) (.cse11 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse3 .cse13 .cse5 .cse14 .cse6 (<= ~d .cse15) .cse8 .cse9 .cse16 (<= .cse15 ~d) .cse17 .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (and .cse12 .cse3 .cse13 .cse5 .cse14 .cse8 .cse9 .cse16 .cse0 .cse1 .cse2 .cse4 .cse7 .cse11 .cse10) (and .cse3 .cse5 .cse6 (<= ~t_b ~data) .cse8 (<= ~data ~t_b) .cse9 (= ~wb_pc 0) (<= ~c_t ~c) .cse17 .cse0 (< ~c (+ ~c_t 1)) .cse7 .cse11)))) [2018-09-26 21:54:44,771 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse3 (<= 2 ~r_st)) (.cse8 (<= ~c_t .cse14)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse4 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse6 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse5 (not (= ~e_c 0)))) (or (and (and .cse0 .cse1 (= ~wl_pc 1) .cse2 (< ~c (+ ~c_t 1)) .cse3 .cse4 .cse5 (<= ~c_t ~c)) .cse6 .cse7) (= ~wl_pc 0) (and .cse8 .cse2 .cse9 .cse3 .cse10 .cse4 .cse7 .cse0 .cse1 .cse11 .cse12 .cse6 .cse13 .cse5) (and .cse8 .cse2 .cse9 (<= ~c .cse14) .cse10 .cse4 .cse7 (<= .cse14 ~c) .cse0 .cse1 .cse11 .cse12 .cse6 .cse13 .cse5)))) [2018-09-26 21:54:44,771 INFO L422 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse3 (<= 2 ~r_st)) (.cse8 (<= ~c_t .cse14)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse4 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse6 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse5 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~wl_pc 0) .cse5) (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4 .cse5 (<= ~c_t ~c)) .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse3 .cse10 .cse4 .cse7 .cse0 .cse1 .cse11 .cse12 .cse6 .cse13 .cse5) (and .cse8 .cse2 .cse9 (<= ~c .cse14) .cse10 .cse4 .cse7 (<= .cse14 ~c) .cse0 .cse1 .cse11 .cse12 .cse6 .cse13 .cse5)))) [2018-09-26 21:54:44,771 INFO L422 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse6 (not (= ~c1_st 0))) (.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (<= ~data ~t_b)) (.cse7 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (= ~wb_st 0) .cse3 (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7) (and .cse4 .cse5 (= ~wb_pc 1) .cse6 (<= 1 ~c1_pc) (<= 2 ~e_wl) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) .cse3 .cse7))) [2018-09-26 21:54:44,772 INFO L422 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse3 (<= 2 ~r_st)) (.cse0 (<= ~c_t .cse14)) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse4 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse7 (not (= ~e_c 1))) (.cse8 (= ~wb_pc 1)) (.cse9 (<= ~data .cse14)) (.cse10 (<= 2 ~e_wl)) (.cse11 (<= 2 ~c1_st)) (.cse12 (<= .cse14 ~data)) (.cse13 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and (= ~wl_pc 1) .cse7 .cse8 .cse1 .cse2 (< ~c (+ ~c_t 1)) .cse3 .cse5 .cse13 (<= ~c_t ~c)) .cse11 .cse6) (and .cse0 .cse1 .cse2 (<= ~c .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2018-09-26 21:54:44,772 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-09-26 21:54:44,772 INFO L422 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (= ~wb_st 0)) (.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse6 (not (= ~c1_st 0))) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse3 (+ ~t_b 1))) (and (<= 1 ~c1_pc) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) (<= ~data .cse3) .cse4 .cse5 (= ~wb_pc 1) .cse6 (<= 2 ~e_wl) .cse7 (<= .cse3 ~data))) (and .cse0 .cse1 (<= ~t_b ~data) .cse2 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7))) [2018-09-26 21:54:44,772 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse1 (<= 2 ~wl_st)) (.cse6 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 1))) (.cse5 (= ~wb_pc 1)) (.cse0 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~r_st)) (.cse3 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0))) (.cse4 (<= 2 ~c2_st))) (or (let ((.cse2 (+ ~t_b 2))) (and .cse0 .cse1 (<= ~c .cse2) .cse3 .cse4 (<= .cse2 ~c) (<= ~c_t ~c) .cse5 (<= ~data .cse2) (<= 2 ~e_wl) (< ~c (+ ~c_t 1)) .cse6 (<= .cse2 ~data) .cse7)) (and .cse8 .cse5 .cse0 .cse1 .cse9 .cse3 .cse7) (and .cse6 (and (= ~wl_pc 1) .cse8 .cse5 .cse0 (= ~wl_st 0) .cse9 .cse3 .cse7) .cse4 (= ~e_wl 1)))) [2018-09-26 21:54:44,772 INFO L422 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2)) (.cse6 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse5 (<= 1 ~c1_pc)) (.cse15 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse10 .cse11 .cse5 .cse6 .cse15 .cse8 .cse14) (and .cse10 .cse11 (= ~wl_pc 1) .cse5 .cse15 .cse8 .cse14))) (.cse7 (<= ~c .cse4)) (.cse3 (<= 2 ~c2_st)) (.cse9 (<= .cse4 ~c)) (.cse12 (<= ~data .cse4)) (.cse0 (<= 2 ~e_wl)) (.cse2 (<= 2 ~c1_st)) (.cse13 (<= .cse4 ~data))) (or (and .cse0 .cse1) (and .cse1 .cse2 .cse3) (= ~wl_pc 0) (and (<= ~c_t .cse4) .cse5 .cse6 .cse7 (<= .cse4 ~c_t) .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse0 .cse2 .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse15 .cse8 .cse3 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse0 (< ~c (+ ~c_t 1)) .cse2 .cse13)))) [2018-09-26 21:54:44,773 INFO L422 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2))) (let ((.cse6 (<= 2 ~r_st)) (.cse7 (<= ~t_b ~data)) (.cse8 (= ~c1_st 0)) (.cse10 (<= ~data ~t_b)) (.cse0 (= ~c2_st 0)) (.cse18 (= ~wl_pc 1)) (.cse12 (<= ~c_t .cse15)) (.cse3 (<= 1 ~c1_pc)) (.cse5 (<= 2 ~wl_st)) (.cse13 (<= ~c .cse15)) (.cse14 (<= .cse15 ~c_t)) (.cse9 (<= 1 ~c2_pc)) (.cse16 (<= 2 ~c2_st)) (.cse17 (<= .cse15 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse19 (<= ~data .cse15)) (.cse4 (<= 2 ~e_wl)) (.cse20 (<= 2 ~c1_st)) (.cse21 (<= .cse15 ~data)) (.cse11 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse3 .cse5 .cse13 .cse6 .cse14 (<= ~d .cse15) .cse9 .cse16 .cse17 (<= .cse15 ~d) .cse18 .cse1 .cse2 .cse19 .cse20 .cse21 .cse11) (and .cse5 .cse6 .cse7 .cse8 (= ~wb_st 0) .cse10 (= ~wb_pc 0) (<= ~c_t ~c) .cse0 .cse18 .cse1 (< ~c (+ ~c_t 1)) .cse11) (and .cse12 .cse3 .cse5 .cse13 .cse14 .cse9 .cse16 .cse17 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse11)))) [2018-09-26 21:54:44,773 INFO L422 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse20 (+ ~t_b 2))) (let ((.cse5 (< ~c (+ ~c_t 1))) (.cse1 (<= ~c_t ~c)) (.cse9 (<= 2 ~wl_st)) (.cse17 (= ~wl_pc 1)) (.cse7 (<= ~c_t .cse20)) (.cse8 (<= 1 ~c1_pc)) (.cse18 (<= ~c .cse20)) (.cse0 (<= 2 ~r_st)) (.cse10 (<= .cse20 ~c_t)) (.cse11 (<= 1 ~c2_pc)) (.cse12 (<= 2 ~c2_st)) (.cse19 (<= .cse20 ~c)) (.cse2 (not (= ~e_c 1))) (.cse13 (= ~wb_pc 1)) (.cse14 (<= ~data .cse20)) (.cse3 (<= 2 ~e_wl)) (.cse4 (= ~wl_st 0)) (.cse15 (<= 2 ~c1_st)) (.cse16 (<= .cse20 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse1 (= ~c2_st 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse3 .cse15 .cse16 .cse6) (and (and .cse17 .cse2 .cse13 .cse8 .cse9 .cse5 .cse0 .cse11 .cse6 .cse1) .cse15 .cse12) (and .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse19 .cse2 .cse13 .cse14 .cse3 .cse15 .cse16 .cse6) (and .cse15 (and .cse17 .cse2 .cse13 .cse8 .cse3 .cse4 .cse0 .cse11 .cse6) .cse12) (and .cse7 .cse8 .cse18 .cse0 .cse10 (<= ~d .cse20) .cse11 .cse12 .cse19 (<= .cse20 ~d) .cse2 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse6)))) [2018-09-26 21:54:44,773 INFO L422 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse6 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse17 (= ~wb_st 0)) (.cse10 (= ~wl_pc 1)) (.cse0 (<= ~c_t .cse6)) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= ~c .cse6)) (.cse5 (<= .cse6 ~c_t)) (.cse7 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse9 (<= .cse6 ~c)) (.cse11 (not (= ~e_c 1))) (.cse12 (= ~wb_pc 1)) (.cse13 (<= ~data .cse6)) (.cse18 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse15 (<= .cse6 ~data)) (.cse16 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 .cse9 (<= .cse6 ~d) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse4 .cse17 .cse7 .cse8 .cse11 .cse12 .cse13 .cse18 .cse14 .cse16 .cse15) (and .cse1 .cse2 .cse4 (<= ~t_b ~data) .cse17 .cse7 (<= ~data ~t_b) .cse8 (= ~wb_pc 0) (<= ~c_t ~c) .cse10 .cse11 (< ~c (+ ~c_t 1)) .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16)))) [2018-09-26 21:54:44,774 INFO L422 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse4 (<= 2 ~r_st)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse7 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse8 (= ~e_wl 1)) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse2 .cse3 (<= ~c .cse9) (<= .cse9 ~c_t) .cse5 .cse8 (<= .cse9 ~c) .cse0 .cse1 (<= ~data .cse9) (<= 2 ~e_wl) .cse7 (<= .cse9 ~data) .cse6)))) [2018-09-26 21:54:44,774 INFO L422 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2)) (.cse6 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse5 (<= 1 ~c1_pc)) (.cse15 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0)))) (let ((.cse0 (or (and .cse10 .cse11 .cse5 .cse6 .cse15 .cse8 .cse14) (and .cse10 .cse11 (= ~wl_pc 1) .cse5 .cse15 .cse8 .cse14))) (.cse7 (<= ~c .cse4)) (.cse2 (<= 2 ~c2_st)) (.cse9 (<= .cse4 ~c)) (.cse12 (<= ~data .cse4)) (.cse3 (<= 2 ~e_wl)) (.cse1 (<= 2 ~c1_st)) (.cse13 (<= .cse4 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0) (= ~wl_pc 0) (and (<= ~c_t .cse4) .cse5 .cse6 .cse7 (<= .cse4 ~c_t) .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse3 .cse1 .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse15 .cse8 .cse2 .cse9 (<= ~c_t ~c) .cse11 .cse12 .cse3 (< ~c (+ ~c_t 1)) .cse1 .cse13 .cse14)))) [2018-09-26 21:54:44,774 INFO L422 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse3 (not (= ~e_c 1))) (.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse6 (not (= ~e_c 0))) (.cse4 (<= 2 ~c1_st)) (.cse5 (not (= ~c2_st 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) (= ~wb_st 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse3 (< ~c (+ ~c_t 1)) .cse4 .cse5 .cse6) (let ((.cse7 (+ ~t_b 1))) (and (and (= ~wb_pc 1) .cse3 .cse0 .cse1 .cse2 (<= 1 ~c2_pc) .cse6) (<= 2 ~e_wl) .cse4 .cse5 (<= ~data .cse7) (<= .cse7 ~data))))) [2018-09-26 21:54:44,828 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:54:44 BoogieIcfgContainer [2018-09-26 21:54:44,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:54:44,829 INFO L168 Benchmark]: Toolchain (without parser) took 26746.00 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 220.7 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 297.8 MB). Peak memory consumption was 693.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:44,830 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:44,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:44,831 INFO L168 Benchmark]: Boogie Preprocessor took 62.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:54:44,832 INFO L168 Benchmark]: RCFGBuilder took 743.74 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:44,838 INFO L168 Benchmark]: TraceAbstraction took 25867.54 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 220.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 266.1 MB). Peak memory consumption was 662.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:54:44,842 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.28 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 63.82 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 62.89 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 743.74 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25867.54 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 220.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 266.1 MB). Peak memory consumption was 662.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: 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: 296]: Loop Invariant Derived loop invariant: ((((2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c1_st) && 2 <= ~c2_st)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c1_st) && 2 <= ~c2_st)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || (((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && 2 <= ~c1_st) && !(~c2_st == 0)) && !(~e_c == 0)) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~c2_st == 0)) && !(~e_c == 0)) && ~t_b + 2 <= ~data) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~data <= ~t_b + 2) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~c < ~c_t + 1) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && ~wb_pc == 0) && ~c_t <= ~c)) && 2 <= ~c1_st) && 2 <= ~c2_st) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((~c2_st == 0 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && !(~c1_st == 0)) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 1 <= ~data) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c1_st == 0)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c1_st == 0)) && ~c < ~c_t + 1) && !(~e_c == 0)) || (((((((((((~c2_st == 0 && !(~e_c == 1)) && ~wb_pc == 1) && !(~c1_st == 0)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~c < ~c_t + 1) && !(~e_c == 0)) || ((2 <= ~c1_st && 2 <= ~c2_st) && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || (((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (2 <= ~c1_st && (((((((((((~t_b + 2 <= ~d && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 0)) || (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) && 2 <= ~c2_st - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || (((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((2 <= ~c1_st && 2 <= ~c2_st) && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((2 <= ~c1_st && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st) && ~e_wl == 1) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((((((((!(~e_c == 1) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && 2 <= ~c1_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~wl_st) && ~t_b + 2 <= ~c_t) && 2 <= ~r_st) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~wl_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) || (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && 2 <= ~c1_st) && !(~e_c == 0)) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~wl_st == 0) && ~c < ~c_t + 1) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~c2_st)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~wl_st == 0) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && ~wl_pc == 0) && !(~e_c == 0)) || ((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && ~c < ~c_t + 1) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 2 <= ~data)) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && 2 <= ~c1_st) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && 2 <= ~c1_st) && !(~c2_st == 0)) && !(~e_c == 0)) || (((((((((((~wb_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~c2_st == 0)) && ~data <= ~t_b + 1) && ~t_b + 1 <= ~data) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c1_st) && 2 <= ~c2_st) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && 2 <= ~c1_st) && !(~e_c == 0)) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && 2 <= ~e_wl) && 2 <= ~c1_st) && !(~e_c == 0)) && ~t_b + 1 <= ~data) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c1_st) && 2 <= ~c2_st) || ~wl_pc == 0) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 25.7s OverallTime, 19 OverallIterations, 8 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1102 SDtfs, 689 SDslu, 1215 SDs, 0 SdLazy, 242 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 510 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 132 NumberOfFragments, 4955 HoareAnnotationTreeSize, 29 FomulaSimplifications, 10256 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 29 FomulaSimplificationsInter, 5782 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1233 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 224845 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 1220/1250 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/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-54-44-889.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-54-44-889.csv Received shutdown request...