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-c372c2b [2018-10-02 12:17:05,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:17:05,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:17:05,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:17:05,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:17:05,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:17:05,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:17:05,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:17:05,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:17:05,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:17:05,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:17:05,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:17:05,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:17:05,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:17:05,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:17:05,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:17:05,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:17:05,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:17:05,755 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:17:05,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:17:05,758 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:17:05,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:17:05,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:17:05,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:17:05,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:17:05,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:17:05,764 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:17:05,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:17:05,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:17:05,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:17:05,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:17:05,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:17:05,769 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:17:05,769 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:17:05,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:17:05,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:17:05,771 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:17:05,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:17:05,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:17:05,797 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:17:05,797 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:17:05,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:17:05,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:17:05,798 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:17:05,799 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:17:05,799 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:17:05,799 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:17:05,799 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:17:05,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:17:05,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:17:05,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:17:05,800 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:17:05,800 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:17:05,800 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:17:05,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:17:05,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:17:05,801 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:17:05,801 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:17:05,801 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:17:05,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:17:05,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:17:05,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:17:05,802 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:17:05,802 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:17:05,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:17:05,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:17:05,803 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:17:05,803 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:17:05,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:17:05,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:17:05,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:17:05,862 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:17:05,862 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:17:05,863 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-10-02 12:17:05,863 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-10-02 12:17:05,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:17:05,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:17:05,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:17:05,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:17:05,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:17:05,957 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:05,973 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:05,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:17:05,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:17:05,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:17:05,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:17:05,994 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:05,995 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:06,005 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:06,005 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:06,020 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:06,029 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:06,031 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 02.10 12:17:05" (1/1) ... [2018-10-02 12:17:06,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:17:06,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:17:06,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:17:06,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:17:06,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:17:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:17:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:17:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:17:06,797 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:17:06,798 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:17:06 BoogieIcfgContainer [2018-10-02 12:17:06,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:17:06,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:17:06,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:17:06,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:17:06,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:17:05" (1/2) ... [2018-10-02 12:17:06,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e25359 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:17:06, skipping insertion in model container [2018-10-02 12:17:06,806 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 02.10 12:17:06" (2/2) ... [2018-10-02 12:17:06,808 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-10-02 12:17:06,818 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:17:06,831 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:17:06,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:17:06,877 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:17:06,877 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:17:06,877 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:17:06,877 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:17:06,877 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:17:06,877 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:17:06,878 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:17:06,878 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:17:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-02 12:17:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:17:06,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:06,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:17:06,907 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:06,913 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-10-02 12:17:06,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:17:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:07,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:07,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:07,132 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-10-02 12:17:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:07,347 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-10-02 12:17:07,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:07,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-02 12:17:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:07,377 INFO L225 Difference]: With dead ends: 82 [2018-10-02 12:17:07,377 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 12:17:07,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 12:17:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-02 12:17:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 12:17:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-10-02 12:17:07,428 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-10-02 12:17:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:07,429 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-10-02 12:17:07,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-10-02 12:17:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:17:07,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:07,430 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:17:07,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:07,431 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-10-02 12:17:07,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:07,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:07,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:07,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:17:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:07,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:07,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:07,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:07,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:07,514 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-10-02 12:17:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:07,770 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-10-02 12:17:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:07,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-02 12:17:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:07,772 INFO L225 Difference]: With dead ends: 98 [2018-10-02 12:17:07,772 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 12:17:07,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 12:17:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-02 12:17:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 12:17:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-10-02 12:17:07,785 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-10-02 12:17:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:07,786 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-10-02 12:17:07,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-10-02 12:17:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:17:07,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:07,788 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:17:07,788 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:07,789 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-10-02 12:17:07,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:17:07,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:07,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:07,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:07,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:07,859 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-10-02 12:17:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:07,953 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-10-02 12:17:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:07,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-02 12:17:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:07,955 INFO L225 Difference]: With dead ends: 105 [2018-10-02 12:17:07,956 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 12:17:07,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 12:17:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-02 12:17:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 12:17:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-10-02 12:17:07,967 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-10-02 12:17:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:07,968 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-10-02 12:17:07,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-10-02 12:17:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 12:17:07,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:07,970 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:17:07,970 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:07,970 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-10-02 12:17:07,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:07,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:08,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-10-02 12:17:08,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:08,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:08,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:08,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:08,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:08,029 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-10-02 12:17:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:08,280 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-10-02 12:17:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:08,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-02 12:17:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:08,282 INFO L225 Difference]: With dead ends: 122 [2018-10-02 12:17:08,282 INFO L226 Difference]: Without dead ends: 73 [2018-10-02 12:17:08,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-02 12:17:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-02 12:17:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 12:17:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-10-02 12:17:08,296 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-10-02 12:17:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:08,297 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-10-02 12:17:08,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-10-02 12:17:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:17:08,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:08,298 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-10-02 12:17:08,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:08,299 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-10-02 12:17:08,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:08,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:08,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:17:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:17:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:08,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:08,372 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-10-02 12:17:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:08,505 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-10-02 12:17:08,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:08,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 12:17:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:08,509 INFO L225 Difference]: With dead ends: 145 [2018-10-02 12:17:08,509 INFO L226 Difference]: Without dead ends: 104 [2018-10-02 12:17:08,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-02 12:17:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-02 12:17:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-02 12:17:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-10-02 12:17:08,535 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-10-02 12:17:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:08,535 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-10-02 12:17:08,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-10-02 12:17:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:17:08,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:08,537 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-10-02 12:17:08,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:08,538 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-10-02 12:17:08,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:08,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:17:08,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:08,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:17:08,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:08,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:08,641 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-10-02 12:17:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:08,990 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-10-02 12:17:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:08,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 12:17:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:08,992 INFO L225 Difference]: With dead ends: 235 [2018-10-02 12:17:08,992 INFO L226 Difference]: Without dead ends: 163 [2018-10-02 12:17:08,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-02 12:17:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-10-02 12:17:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-02 12:17:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-10-02 12:17:09,013 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-10-02 12:17:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:09,013 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-10-02 12:17:09,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-10-02 12:17:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 12:17:09,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:09,016 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-10-02 12:17:09,017 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:09,017 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-10-02 12:17:09,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:09,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 12:17:09,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:09,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:09,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:09,104 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:09,104 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-10-02 12:17:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:09,212 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-10-02 12:17:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:09,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 12:17:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:09,215 INFO L225 Difference]: With dead ends: 288 [2018-10-02 12:17:09,215 INFO L226 Difference]: Without dead ends: 164 [2018-10-02 12:17:09,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-02 12:17:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-02 12:17:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-02 12:17:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-10-02 12:17:09,240 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-10-02 12:17:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:09,241 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-10-02 12:17:09,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-10-02 12:17:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 12:17:09,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:09,244 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-10-02 12:17:09,244 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:09,244 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-10-02 12:17:09,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:09,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:09,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 12:17:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:09,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:09,323 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-10-02 12:17:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:09,946 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-10-02 12:17:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:09,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 12:17:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:09,948 INFO L225 Difference]: With dead ends: 312 [2018-10-02 12:17:09,949 INFO L226 Difference]: Without dead ends: 182 [2018-10-02 12:17:09,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-02 12:17:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-02 12:17:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-02 12:17:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-10-02 12:17:09,975 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-10-02 12:17:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:09,975 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-10-02 12:17:09,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-10-02 12:17:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 12:17:09,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:09,978 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-10-02 12:17:09,978 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:09,978 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-10-02 12:17:09,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:09,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:09,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:09,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:09,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:17:10,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:10,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:17:10,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:10,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:10,083 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-10-02 12:17:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:10,288 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-10-02 12:17:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:10,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-02 12:17:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:10,291 INFO L225 Difference]: With dead ends: 345 [2018-10-02 12:17:10,292 INFO L226 Difference]: Without dead ends: 177 [2018-10-02 12:17:10,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-02 12:17:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-02 12:17:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-02 12:17:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-10-02 12:17:10,312 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-10-02 12:17:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:10,313 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-10-02 12:17:10,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-10-02 12:17:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 12:17:10,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:10,315 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-10-02 12:17:10,315 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:10,316 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:10,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-10-02 12:17:10,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:10,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:10,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 12:17:10,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:10,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:17:10,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:10,381 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:10,381 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-10-02 12:17:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:10,558 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-10-02 12:17:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:10,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-02 12:17:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:10,561 INFO L225 Difference]: With dead ends: 335 [2018-10-02 12:17:10,562 INFO L226 Difference]: Without dead ends: 174 [2018-10-02 12:17:10,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-02 12:17:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-10-02 12:17:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-02 12:17:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-10-02 12:17:10,581 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-10-02 12:17:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:10,581 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-10-02 12:17:10,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-10-02 12:17:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 12:17:10,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:10,583 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-10-02 12:17:10,583 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:10,584 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:10,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-10-02 12:17:10,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:10,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:10,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:17:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:10,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:17:10,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:10,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 12:17:11,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:17:11,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-02 12:17:11,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:17:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:17:11,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:11,549 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 5 states. [2018-10-02 12:17:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:12,391 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2018-10-02 12:17:12,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:17:12,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-02 12:17:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:12,393 INFO L225 Difference]: With dead ends: 451 [2018-10-02 12:17:12,394 INFO L226 Difference]: Without dead ends: 293 [2018-10-02 12:17:12,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.0s impTime [2018-10-02 12:17:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-02 12:17:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-10-02 12:17:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-02 12:17:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2018-10-02 12:17:12,430 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 52 [2018-10-02 12:17:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:12,431 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2018-10-02 12:17:12,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:17:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-10-02 12:17:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 12:17:12,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:12,432 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-10-02 12:17:12,433 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:12,433 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash -784981334, now seen corresponding path program 1 times [2018-10-02 12:17:12,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:12,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 12:17:12,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:12,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:12,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:12,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:12,555 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand 3 states. [2018-10-02 12:17:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:12,896 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2018-10-02 12:17:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:12,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-02 12:17:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:12,900 INFO L225 Difference]: With dead ends: 726 [2018-10-02 12:17:12,900 INFO L226 Difference]: Without dead ends: 486 [2018-10-02 12:17:12,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-02 12:17:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2018-10-02 12:17:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-02 12:17:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2018-10-02 12:17:12,984 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 52 [2018-10-02 12:17:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:12,984 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2018-10-02 12:17:12,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2018-10-02 12:17:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 12:17:12,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:12,986 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-10-02 12:17:12,987 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:12,987 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1664618796, now seen corresponding path program 1 times [2018-10-02 12:17:12,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:12,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:12,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-02 12:17:13,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:13,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:13,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:13,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:13,088 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 3 states. [2018-10-02 12:17:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:13,643 INFO L93 Difference]: Finished difference Result 782 states and 1089 transitions. [2018-10-02 12:17:13,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:13,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-02 12:17:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:13,646 INFO L225 Difference]: With dead ends: 782 [2018-10-02 12:17:13,646 INFO L226 Difference]: Without dead ends: 404 [2018-10-02 12:17:13,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-02 12:17:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-10-02 12:17:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-02 12:17:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2018-10-02 12:17:13,720 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 52 [2018-10-02 12:17:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:13,720 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2018-10-02 12:17:13,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2018-10-02 12:17:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-02 12:17:13,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:13,722 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-10-02 12:17:13,722 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:13,723 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash -232860399, now seen corresponding path program 1 times [2018-10-02 12:17:13,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:13,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:13,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-02 12:17:13,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:13,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:17:13,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:13,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:13,819 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:13,820 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand 3 states. [2018-10-02 12:17:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:14,550 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-10-02 12:17:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:14,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-10-02 12:17:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:14,554 INFO L225 Difference]: With dead ends: 581 [2018-10-02 12:17:14,554 INFO L226 Difference]: Without dead ends: 192 [2018-10-02 12:17:14,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-02 12:17:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2018-10-02 12:17:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-02 12:17:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-10-02 12:17:14,586 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 61 [2018-10-02 12:17:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:14,586 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-10-02 12:17:14,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-10-02 12:17:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-02 12:17:14,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:14,587 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-10-02 12:17:14,588 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:14,588 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-10-02 12:17:14,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:14,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-02 12:17:14,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:14,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:17:14,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:14,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:14,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:14,732 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 3 states. [2018-10-02 12:17:15,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:15,382 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2018-10-02 12:17:15,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:15,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-10-02 12:17:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:15,384 INFO L225 Difference]: With dead ends: 430 [2018-10-02 12:17:15,384 INFO L226 Difference]: Without dead ends: 273 [2018-10-02 12:17:15,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-02 12:17:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-02 12:17:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-02 12:17:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-10-02 12:17:15,433 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 75 [2018-10-02 12:17:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:15,434 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-10-02 12:17:15,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-10-02 12:17:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-02 12:17:15,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:15,435 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-10-02 12:17:15,435 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:15,436 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-10-02 12:17:15,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:15,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:15,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 12:17:16,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:16,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:17:16,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:16,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 12:17:17,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:17,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 12:17:17,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:17:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:17:17,129 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:17,129 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2018-10-02 12:17:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:18,981 INFO L93 Difference]: Finished difference Result 1096 states and 1350 transitions. [2018-10-02 12:17:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:17:18,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-10-02 12:17:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:18,987 INFO L225 Difference]: With dead ends: 1096 [2018-10-02 12:17:18,987 INFO L226 Difference]: Without dead ends: 840 [2018-10-02 12:17:18,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.4s impTime [2018-10-02 12:17:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-10-02 12:17:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 457. [2018-10-02 12:17:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-10-02 12:17:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2018-10-02 12:17:19,073 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 75 [2018-10-02 12:17:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:19,073 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2018-10-02 12:17:19,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:17:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2018-10-02 12:17:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-02 12:17:19,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:19,075 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-10-02 12:17:19,075 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:19,075 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash 44732949, now seen corresponding path program 1 times [2018-10-02 12:17:19,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-02 12:17:19,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:17:19,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:19,153 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:19,153 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 3 states. [2018-10-02 12:17:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:19,599 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-10-02 12:17:19,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:19,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-10-02 12:17:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:19,601 INFO L225 Difference]: With dead ends: 702 [2018-10-02 12:17:19,601 INFO L226 Difference]: Without dead ends: 259 [2018-10-02 12:17:19,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-02 12:17:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-02 12:17:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-02 12:17:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2018-10-02 12:17:19,641 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 82 [2018-10-02 12:17:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:19,641 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2018-10-02 12:17:19,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2018-10-02 12:17:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-02 12:17:19,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:19,643 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-10-02 12:17:19,643 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:19,643 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 2 times [2018-10-02 12:17:19,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:19,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:19,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:19,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-02 12:17:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:19,872 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:17:19,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:17:19,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:17:19,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:19,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:17:20,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:17:20,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 12:17:20,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:17:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:17:20,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:20,062 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand 5 states. [2018-10-02 12:17:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:20,337 INFO L93 Difference]: Finished difference Result 491 states and 600 transitions. [2018-10-02 12:17:20,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:17:20,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-10-02 12:17:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:20,339 INFO L225 Difference]: With dead ends: 491 [2018-10-02 12:17:20,339 INFO L226 Difference]: Without dead ends: 248 [2018-10-02 12:17:20,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:17:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-02 12:17:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-10-02 12:17:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-02 12:17:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2018-10-02 12:17:20,383 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 102 [2018-10-02 12:17:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:20,383 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-10-02 12:17:20,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:17:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2018-10-02 12:17:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-02 12:17:20,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:20,384 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-10-02 12:17:20,385 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:20,385 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2108568021, now seen corresponding path program 3 times [2018-10-02 12:17:20,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:20,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:20,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:20,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:20,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-02 12:17:20,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:20,526 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:17:20,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:17:20,581 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 12:17:20,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:20,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-02 12:17:20,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:17:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-02 12:17:20,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:17:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:17:20,686 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:20,687 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand 4 states. [2018-10-02 12:17:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:20,760 INFO L93 Difference]: Finished difference Result 322 states and 376 transitions. [2018-10-02 12:17:20,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:17:20,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-02 12:17:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:20,761 INFO L225 Difference]: With dead ends: 322 [2018-10-02 12:17:20,761 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:17:20,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:17:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:17:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:17:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:17:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:17:20,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2018-10-02 12:17:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:20,763 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:17:20,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:17:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:17:20,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:17:20,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:17:20,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:20,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:21,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:21,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:21,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:21,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:21,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:23,669 WARN L178 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-10-02 12:17:24,086 WARN L178 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-10-02 12:17:24,386 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-10-02 12:17:24,899 WARN L178 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-10-02 12:17:25,215 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-10-02 12:17:25,503 WARN L178 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-10-02 12:17:25,876 WARN L178 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-02 12:17:26,190 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-02 12:17:26,358 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-10-02 12:17:26,546 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-10-02 12:17:26,820 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-10-02 12:17:27,091 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-10-02 12:17:27,393 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-10-02 12:17:27,587 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-10-02 12:17:27,720 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-02 12:17:28,086 WARN L178 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-10-02 12:17:28,289 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-10-02 12:17:28,535 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-10-02 12:17:28,895 WARN L178 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-10-02 12:17:29,202 WARN L178 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-02 12:17:29,712 WARN L178 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-10-02 12:17:30,163 WARN L178 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2018-10-02 12:17:30,615 WARN L178 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-10-02 12:17:30,922 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-02 12:17:31,058 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-10-02 12:17:31,557 WARN L178 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2018-10-02 12:17:32,267 WARN L178 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-02 12:17:32,482 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-10-02 12:17:32,487 INFO L421 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-10-02 12:17:32,487 INFO L421 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-10-02 12:17:32,488 INFO L421 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-10-02 12:17:32,488 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-10-02 12:17:32,488 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-10-02 12:17:32,488 INFO L421 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-10-02 12:17:32,488 INFO L421 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-10-02 12:17:32,488 INFO L421 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-10-02 12:17:32,489 INFO L421 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-10-02 12:17:32,489 INFO L421 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-10-02 12:17:32,489 INFO L421 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-10-02 12:17:32,489 INFO L421 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-10-02 12:17:32,489 INFO L421 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-10-02 12:17:32,490 INFO L421 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-10-02 12:17:32,490 INFO L421 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-10-02 12:17:32,490 INFO L421 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-10-02 12:17:32,490 INFO L421 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-10-02 12:17:32,490 INFO L421 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-10-02 12:17:32,490 INFO L421 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-10-02 12:17:32,491 INFO L421 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-10-02 12:17:32,491 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-10-02 12:17:32,491 INFO L421 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-10-02 12:17:32,491 INFO L421 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-10-02 12:17:32,491 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-10-02 12:17:32,491 INFO L421 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-10-02 12:17:32,491 INFO L421 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-10-02 12:17:32,492 INFO L421 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-10-02 12:17:32,492 INFO L421 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-10-02 12:17:32,492 INFO L421 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-10-02 12:17:32,492 INFO L421 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-10-02 12:17:32,492 INFO L421 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-10-02 12:17:32,493 INFO L421 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-10-02 12:17:32,493 INFO L421 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-10-02 12:17:32,546 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:17:32 BoogieIcfgContainer [2018-10-02 12:17:32,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:17:32,547 INFO L168 Benchmark]: Toolchain (without parser) took 26615.40 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 216.0 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 237.6 MB). Peak memory consumption was 693.0 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:32,548 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:32,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:32,549 INFO L168 Benchmark]: Boogie Preprocessor took 56.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:32,550 INFO L168 Benchmark]: RCFGBuilder took 756.67 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-10-02 12:17:32,551 INFO L168 Benchmark]: TraceAbstraction took 25746.89 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 216.0 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 205.9 MB). Peak memory consumption was 661.3 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:32,555 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.20 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 45.96 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 56.31 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 756.67 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 25746.89 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 216.0 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 205.9 MB). Peak memory consumption was 661.3 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.6s OverallTime, 19 OverallIterations, 8 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 11.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1102 SDtfs, 705 SDslu, 1189 SDs, 0 SdLazy, 245 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s 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, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s 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-10-02_12-17-32-584.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-10-02_12-17-32-584.csv Received shutdown request...