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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:45:44,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:45:44,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:45:44,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:45:44,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:45:44,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:45:44,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:45:44,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:45:44,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:45:44,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:45:44,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:45:44,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:45:44,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:45:44,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:45:44,896 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:45:44,897 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:45:44,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:45:44,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:45:44,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:45:44,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:45:44,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:45:44,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:45:44,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:45:44,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:45:44,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:45:44,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:45:44,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:45:44,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:45:44,916 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:45:44,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:45:44,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:45:44,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:45:44,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:45:44,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:45:44,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:45:44,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:45:44,921 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:45:44,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:45:44,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:45:44,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:45:44,944 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:45:44,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:45:44,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:45:44,945 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:45:44,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:45:44,946 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:45:44,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:45:44,946 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:45:44,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:45:44,946 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:45:44,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:45:44,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:45:44,947 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:45:44,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:45:44,947 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:45:44,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:45:44,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:45:44,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:45:44,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:45:44,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:45:44,949 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:45:44,949 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:45:44,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:45:44,950 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:45:44,950 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:45:44,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:45:44,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:45:45,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:45:45,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:45:45,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:45:45,030 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:45:45,031 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:45:45,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-09-30 23:45:45,032 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-09-30 23:45:45,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:45:45,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:45:45,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:45:45,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:45:45,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:45:45,143 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,159 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:45:45,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:45:45,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:45:45,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:45:45,179 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,179 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,182 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,182 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,191 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,194 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,196 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 30.09 11:45:45" (1/1) ... [2018-09-30 23:45:45,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:45:45,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:45:45,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:45:45,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:45:45,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:45:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:45:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:45:45,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:45:45,944 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:45:45,945 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:45:45 BoogieIcfgContainer [2018-09-30 23:45:45,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:45:45,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:45:45,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:45:45,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:45:45,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:45:45" (1/2) ... [2018-09-30 23:45:45,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ad0e20 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:45:45, skipping insertion in model container [2018-09-30 23:45:45,953 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 30.09 11:45:45" (2/2) ... [2018-09-30 23:45:45,954 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-09-30 23:45:45,962 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:45:45,971 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:45:46,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:45:46,024 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:45:46,024 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:45:46,024 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:45:46,024 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:45:46,024 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:45:46,025 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:45:46,025 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:45:46,025 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:45:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-30 23:45:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:45:46,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:46,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:46,048 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:46,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-09-30 23:45:46,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:46,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:46,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:46,234 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:46,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:46,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,254 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-09-30 23:45:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:46,349 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-09-30 23:45:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:46,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-30 23:45:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:46,364 INFO L225 Difference]: With dead ends: 82 [2018-09-30 23:45:46,364 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 23:45:46,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 23:45:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 23:45:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 23:45:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-09-30 23:45:46,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-09-30 23:45:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:46,417 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-09-30 23:45:46,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-09-30 23:45:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:45:46,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:46,419 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:46,419 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:46,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-09-30 23:45:46,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:46,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:46,484 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:46,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:46,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,486 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-09-30 23:45:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:46,549 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-09-30 23:45:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:46,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 23:45:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:46,551 INFO L225 Difference]: With dead ends: 98 [2018-09-30 23:45:46,551 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 23:45:46,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 23:45:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-30 23:45:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 23:45:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-09-30 23:45:46,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-09-30 23:45:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:46,563 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-09-30 23:45:46,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-09-30 23:45:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 23:45:46,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:46,565 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:46,565 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:46,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-09-30 23:45:46,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:46,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:46,639 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:46,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:46,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:46,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,641 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-09-30 23:45:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:46,700 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-09-30 23:45:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:46,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 23:45:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:46,703 INFO L225 Difference]: With dead ends: 105 [2018-09-30 23:45:46,704 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 23:45:46,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 23:45:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 23:45:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 23:45:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-09-30 23:45:46,727 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-09-30 23:45:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:46,728 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-09-30 23:45:46,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-09-30 23:45:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:45:46,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:46,731 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:46,731 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:46,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-09-30 23:45:46,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:46,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:46,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:46,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:46,813 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:46,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:46,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:46,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,815 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-09-30 23:45:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:46,915 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-09-30 23:45:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:46,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-09-30 23:45:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:46,917 INFO L225 Difference]: With dead ends: 122 [2018-09-30 23:45:46,918 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 23:45:46,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 23:45:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-30 23:45:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 23:45:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-09-30 23:45:46,933 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-09-30 23:45:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:46,934 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-09-30 23:45:46,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-09-30 23:45:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 23:45:46,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:46,935 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:46,936 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:46,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-09-30 23:45:46,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:46,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:47,031 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:47,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:45:47,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,033 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-09-30 23:45:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:47,144 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-09-30 23:45:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:47,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 23:45:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:47,146 INFO L225 Difference]: With dead ends: 145 [2018-09-30 23:45:47,146 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 23:45:47,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 23:45:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-30 23:45:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-30 23:45:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-09-30 23:45:47,163 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-09-30 23:45:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:47,163 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-09-30 23:45:47,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-09-30 23:45:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 23:45:47,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:47,165 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:47,166 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:47,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-09-30 23:45:47,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:47,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:47,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:45:47,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,253 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-09-30 23:45:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:47,379 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-09-30 23:45:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:47,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 23:45:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:47,382 INFO L225 Difference]: With dead ends: 235 [2018-09-30 23:45:47,382 INFO L226 Difference]: Without dead ends: 163 [2018-09-30 23:45:47,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-30 23:45:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-09-30 23:45:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-30 23:45:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-09-30 23:45:47,413 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-09-30 23:45:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:47,413 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-09-30 23:45:47,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-09-30 23:45:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 23:45:47,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:47,420 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:47,420 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:47,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-09-30 23:45:47,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:47,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:47,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-30 23:45:47,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:47,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:47,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:47,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,507 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-09-30 23:45:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:47,578 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-09-30 23:45:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:47,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 23:45:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:47,580 INFO L225 Difference]: With dead ends: 288 [2018-09-30 23:45:47,580 INFO L226 Difference]: Without dead ends: 164 [2018-09-30 23:45:47,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-30 23:45:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-30 23:45:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-30 23:45:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-09-30 23:45:47,626 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-09-30 23:45:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:47,629 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-09-30 23:45:47,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-09-30 23:45:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 23:45:47,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:47,634 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:47,634 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:47,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:47,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-09-30 23:45:47,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:47,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:47,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:47,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-30 23:45:47,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:47,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:47,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:47,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:47,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,751 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-09-30 23:45:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:47,889 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-09-30 23:45:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:47,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 23:45:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:47,893 INFO L225 Difference]: With dead ends: 312 [2018-09-30 23:45:47,894 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 23:45:47,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 23:45:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-30 23:45:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-30 23:45:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-09-30 23:45:47,932 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-09-30 23:45:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:47,933 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-09-30 23:45:47,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-09-30 23:45:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 23:45:47,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:47,940 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:47,940 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:47,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-09-30 23:45:47,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:47,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:45:48,040 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:48,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:45:48,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:48,042 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-09-30 23:45:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:48,141 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-09-30 23:45:48,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:48,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 23:45:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:48,143 INFO L225 Difference]: With dead ends: 345 [2018-09-30 23:45:48,144 INFO L226 Difference]: Without dead ends: 177 [2018-09-30 23:45:48,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-30 23:45:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-09-30 23:45:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 23:45:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-09-30 23:45:48,164 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-09-30 23:45:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:48,164 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-09-30 23:45:48,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-09-30 23:45:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 23:45:48,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:48,166 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:48,166 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:48,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-09-30 23:45:48,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:48,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:48,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:48,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:45:48,254 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:48,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:45:48,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:48,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:48,256 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-09-30 23:45:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:48,360 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-09-30 23:45:48,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:48,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-30 23:45:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:48,362 INFO L225 Difference]: With dead ends: 335 [2018-09-30 23:45:48,362 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 23:45:48,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 23:45:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-09-30 23:45:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 23:45:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-09-30 23:45:48,383 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-09-30 23:45:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-09-30 23:45:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-09-30 23:45:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 23:45:48,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:48,385 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:48,385 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:48,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-09-30 23:45:48,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:48,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:48,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:45:48,509 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:45:48,509 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:45:48,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:48,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:45:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 23:45:48,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 23:45:48,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-09-30 23:45:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:45:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:45:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:45:48,754 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 5 states. [2018-09-30 23:45:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:49,222 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2018-09-30 23:45:49,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:45:49,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-09-30 23:45:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:49,225 INFO L225 Difference]: With dead ends: 451 [2018-09-30 23:45:49,225 INFO L226 Difference]: Without dead ends: 293 [2018-09-30 23:45:49,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:45:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-30 23:45:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-09-30 23:45:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-30 23:45:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2018-09-30 23:45:49,263 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 52 [2018-09-30 23:45:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:49,263 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2018-09-30 23:45:49,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:45:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-09-30 23:45:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 23:45:49,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:49,265 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:49,265 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:49,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash -784981334, now seen corresponding path program 1 times [2018-09-30 23:45:49,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:49,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:49,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:49,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:49,505 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-09-30 23:45:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-30 23:45:49,515 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:49,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:49,517 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand 3 states. [2018-09-30 23:45:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:49,648 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2018-09-30 23:45:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:49,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-30 23:45:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:49,652 INFO L225 Difference]: With dead ends: 726 [2018-09-30 23:45:49,652 INFO L226 Difference]: Without dead ends: 486 [2018-09-30 23:45:49,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-09-30 23:45:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2018-09-30 23:45:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-09-30 23:45:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2018-09-30 23:45:49,713 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 52 [2018-09-30 23:45:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:49,713 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2018-09-30 23:45:49,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2018-09-30 23:45:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 23:45:49,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:49,715 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:49,715 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:49,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1664618796, now seen corresponding path program 1 times [2018-09-30 23:45:49,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:49,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-09-30 23:45:49,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:49,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:49,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:49,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:49,792 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 3 states. [2018-09-30 23:45:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:49,963 INFO L93 Difference]: Finished difference Result 782 states and 1089 transitions. [2018-09-30 23:45:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:49,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-30 23:45:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:49,966 INFO L225 Difference]: With dead ends: 782 [2018-09-30 23:45:49,966 INFO L226 Difference]: Without dead ends: 404 [2018-09-30 23:45:49,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-09-30 23:45:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-09-30 23:45:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-09-30 23:45:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2018-09-30 23:45:50,023 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 52 [2018-09-30 23:45:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:50,023 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2018-09-30 23:45:50,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2018-09-30 23:45:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 23:45:50,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:50,025 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:50,025 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:50,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash -232860399, now seen corresponding path program 1 times [2018-09-30 23:45:50,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:50,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:50,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:50,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-30 23:45:50,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:50,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:45:50,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:50,100 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand 3 states. [2018-09-30 23:45:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:50,242 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-09-30 23:45:50,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:50,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-09-30 23:45:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:50,244 INFO L225 Difference]: With dead ends: 581 [2018-09-30 23:45:50,245 INFO L226 Difference]: Without dead ends: 192 [2018-09-30 23:45:50,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-30 23:45:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2018-09-30 23:45:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-30 23:45:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-09-30 23:45:50,270 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 61 [2018-09-30 23:45:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:50,270 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-09-30 23:45:50,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-09-30 23:45:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 23:45:50,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:50,272 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:50,272 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:50,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-09-30 23:45:50,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:50,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:50,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-30 23:45:50,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:50,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:45:50,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:50,379 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 3 states. [2018-09-30 23:45:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:50,555 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2018-09-30 23:45:50,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:50,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-09-30 23:45:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:50,558 INFO L225 Difference]: With dead ends: 430 [2018-09-30 23:45:50,558 INFO L226 Difference]: Without dead ends: 273 [2018-09-30 23:45:50,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-30 23:45:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-09-30 23:45:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-30 23:45:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-09-30 23:45:50,603 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 75 [2018-09-30 23:45:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:50,603 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-09-30 23:45:50,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-09-30 23:45:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 23:45:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:50,605 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:50,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-09-30 23:45:50,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 23:45:51,208 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:45:51,209 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:45:51,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:51,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:45:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 23:45:51,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:45:51,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-30 23:45:51,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:45:51,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:45:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:45:51,438 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2018-09-30 23:45:52,240 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-30 23:45:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:53,351 INFO L93 Difference]: Finished difference Result 1096 states and 1350 transitions. [2018-09-30 23:45:53,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:45:53,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-09-30 23:45:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:53,357 INFO L225 Difference]: With dead ends: 1096 [2018-09-30 23:45:53,357 INFO L226 Difference]: Without dead ends: 840 [2018-09-30 23:45:53,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:45:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-09-30 23:45:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 457. [2018-09-30 23:45:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-09-30 23:45:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2018-09-30 23:45:53,445 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 75 [2018-09-30 23:45:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:53,445 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2018-09-30 23:45:53,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:45:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2018-09-30 23:45:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-30 23:45:53,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:53,448 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:53,448 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:53,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash 44732949, now seen corresponding path program 1 times [2018-09-30 23:45:53,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:53,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-30 23:45:53,527 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:45:53,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:45:53,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:45:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:45:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:53,528 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 3 states. [2018-09-30 23:45:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:53,685 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-09-30 23:45:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:45:53,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-09-30 23:45:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:53,687 INFO L225 Difference]: With dead ends: 702 [2018-09-30 23:45:53,687 INFO L226 Difference]: Without dead ends: 259 [2018-09-30 23:45:53,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:45:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-30 23:45:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-09-30 23:45:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 23:45:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2018-09-30 23:45:53,735 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 82 [2018-09-30 23:45:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:53,735 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2018-09-30 23:45:53,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:45:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2018-09-30 23:45:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 23:45:53,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:53,737 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:53,738 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:53,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 2 times [2018-09-30 23:45:53,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:53,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:53,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:45:53,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-30 23:45:53,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:45:53,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:45:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:45:54,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:45:54,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:45:54,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:45:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-30 23:45:54,100 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 23:45:54,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-09-30 23:45:54,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:45:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:45:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:45:54,101 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand 4 states. [2018-09-30 23:45:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:54,231 INFO L93 Difference]: Finished difference Result 491 states and 600 transitions. [2018-09-30 23:45:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:45:54,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-09-30 23:45:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:54,233 INFO L225 Difference]: With dead ends: 491 [2018-09-30 23:45:54,234 INFO L226 Difference]: Without dead ends: 248 [2018-09-30 23:45:54,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:45:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-30 23:45:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-09-30 23:45:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-30 23:45:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2018-09-30 23:45:54,279 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 293 transitions. Word has length 102 [2018-09-30 23:45:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:54,279 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-09-30 23:45:54,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:45:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 293 transitions. [2018-09-30 23:45:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 23:45:54,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:45:54,281 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:45:54,281 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:45:54,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:45:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2108568021, now seen corresponding path program 3 times [2018-09-30 23:45:54,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:45:54,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:45:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:54,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:45:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:45:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:45:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-30 23:45:54,509 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:45:54,509 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:45:54,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 23:45:54,591 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 23:45:54,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:45:54,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:45:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-09-30 23:45:54,633 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 23:45:54,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-09-30 23:45:54,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:45:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:45:54,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:45:54,634 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. Second operand 4 states. [2018-09-30 23:45:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:45:54,756 INFO L93 Difference]: Finished difference Result 322 states and 376 transitions. [2018-09-30 23:45:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:45:54,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-09-30 23:45:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:45:54,757 INFO L225 Difference]: With dead ends: 322 [2018-09-30 23:45:54,757 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:45:54,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:45:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:45:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:45:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:45:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:45:54,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2018-09-30 23:45:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:45:54,759 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:45:54,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:45:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:45:54,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:45:54,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:45:54,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:54,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:54,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:55,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:55,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:55,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:55,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:45:56,361 WARN L178 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-09-30 23:45:56,681 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-09-30 23:45:57,038 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-09-30 23:45:57,350 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-09-30 23:45:57,697 WARN L178 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-09-30 23:45:57,806 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-30 23:45:57,972 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-30 23:45:58,153 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-09-30 23:45:58,487 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-09-30 23:45:58,770 WARN L178 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-09-30 23:45:58,975 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-09-30 23:45:59,189 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-09-30 23:45:59,310 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-09-30 23:45:59,606 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-09-30 23:45:59,819 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-09-30 23:46:00,016 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-09-30 23:46:00,343 WARN L178 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-09-30 23:46:00,499 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-30 23:46:00,958 WARN L178 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-09-30 23:46:01,436 WARN L178 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-09-30 23:46:01,712 WARN L178 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-09-30 23:46:02,182 WARN L178 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-30 23:46:02,681 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-09-30 23:46:02,992 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-30 23:46:03,236 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-09-30 23:46:03,239 INFO L422 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse13 (+ ~t_b 2))) (let ((.cse6 (<= 2 ~r_st)) (.cse5 (= ~wl_st 0)) (.cse10 (<= ~c_t .cse13)) (.cse3 (<= 1 ~c1_pc)) (.cse11 (<= ~c .cse13)) (.cse12 (<= .cse13 ~c_t)) (.cse7 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse14 (<= .cse13 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse15 (<= ~data .cse13)) (.cse4 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse16 (<= .cse13 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse6 (<= ~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 .cse4 .cse5 .cse8 (< ~c (+ ~c_t 1))) (and .cse10 .cse3 .cse11 .cse6 .cse12 (<= ~d .cse13) .cse7 .cse9 .cse14 (<= .cse13 ~d) .cse1 .cse2 .cse15 .cse4 .cse5 .cse0 .cse16 .cse8) (and .cse10 .cse3 (<= 2 ~wl_st) .cse11 .cse12 .cse7 .cse9 .cse14 .cse1 .cse2 .cse15 .cse4 .cse0 .cse16 .cse8)))) [2018-09-30 23:46:03,239 INFO L422 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse4 (<= 2 ~r_st)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse8 (<= 2 ~e_wl)) (.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 .cse8 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse9) (let ((.cse10 (+ ~t_b 2))) (and (<= ~c_t .cse10) .cse2 .cse3 (<= ~c .cse10) (<= .cse10 ~c_t) .cse5 .cse9 (<= .cse10 ~c) .cse0 .cse1 (<= ~data .cse10) .cse8 .cse7 (<= .cse10 ~data) .cse6)))) [2018-09-30 23:46:03,239 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse9 (<= ~c .cse14)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse10 (<= .cse14 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse3 .cse8 .cse9 .cse4 .cse5 .cse7 .cse10 (<= ~c_t ~c) .cse2 .cse11 .cse12 .cse0 .cse13 .cse6 (< ~c (+ ~c_t 1))) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and (<= ~c_t .cse14) .cse3 .cse8 .cse9 (<= .cse14 ~c_t) .cse5 .cse7 .cse10 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-09-30 23:46:03,239 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-09-30 23:46:03,239 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-09-30 23:46:03,240 INFO L422 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse9 (<= ~c .cse14)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse10 (<= .cse14 ~c)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse3 .cse8 .cse9 .cse4 .cse5 .cse7 .cse10 (<= ~c_t ~c) .cse2 .cse11 .cse12 .cse0 .cse13 .cse6 (< ~c (+ ~c_t 1))) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and (<= ~c_t .cse14) .cse3 .cse8 .cse9 (<= .cse14 ~c_t) .cse5 .cse7 .cse10 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-09-30 23:46:03,240 INFO L422 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse15 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse4 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse13 (not (= ~e_c 0)))) (let ((.cse0 (or (and .cse15 .cse10 .cse4 .cse5 .cse7 .cse8 .cse13) (and .cse15 .cse10 (= ~wl_pc 1) .cse4 .cse7 .cse8 .cse13))) (.cse6 (<= ~c .cse14)) (.cse2 (<= 2 ~c2_st)) (.cse9 (<= .cse14 ~c)) (.cse11 (<= ~data .cse14)) (.cse3 (<= 2 ~e_wl)) (.cse1 (<= 2 ~c1_st)) (.cse12 (<= .cse14 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse3 .cse1 .cse12 .cse13 (< ~c (+ ~c_t 1))) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c_t) .cse8 .cse2 .cse9 .cse15 .cse10 .cse11 .cse3 .cse1 .cse12 .cse13)))) [2018-09-30 23:46:03,240 INFO L422 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse4 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse15 (not (= ~e_c 0)))) (let ((.cse2 (or (and .cse10 .cse11 .cse4 .cse5 .cse7 .cse8 .cse15) (and .cse10 .cse11 (= ~wl_pc 1) .cse4 .cse7 .cse8 .cse15))) (.cse6 (<= ~c .cse14)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse14 ~c)) (.cse12 (<= ~data .cse14)) (.cse3 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 (< ~c (+ ~c_t 1))) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c_t) .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 .cse15)))) [2018-09-30 23:46:03,240 INFO L422 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse1 (not (= ~e_c 1))) (.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse2 (= ~wb_pc 1)) (.cse0 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (let ((.cse9 (+ ~t_b 2))) (and .cse3 .cse8 (<= ~c .cse9) .cse5 .cse7 (<= .cse9 ~c) (<= ~c_t ~c) .cse2 (<= ~data .cse9) (<= 2 ~e_wl) .cse0 (<= .cse9 ~data) .cse6 (< ~c (+ ~c_t 1)))))) [2018-09-30 23:46:03,241 INFO L422 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse19 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 1)) (.cse13 (<= ~c_t ~c)) (.cse12 (< ~c (+ ~c_t 1))) (.cse7 (<= 2 ~r_st)) (.cse6 (= ~wl_st 0)) (.cse14 (<= ~c_t .cse19)) (.cse4 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~wl_st)) (.cse18 (<= ~c .cse19)) (.cse15 (<= .cse19 ~c_t)) (.cse8 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse20 (<= .cse19 ~c)) (.cse2 (not (= ~e_c 1))) (.cse3 (= ~wb_pc 1)) (.cse16 (<= ~data .cse19)) (.cse5 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse17 (<= .cse19 ~data)) (.cse9 (not (= ~e_c 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse9 .cse12 .cse13) .cse0 .cse10) (and .cse14 .cse4 .cse11 .cse7 .cse15 .cse8 .cse10 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9) (and .cse7 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse13 (= ~c2_st 0) .cse2 .cse5 .cse6 .cse9 .cse12) (and .cse14 .cse4 .cse18 .cse7 .cse15 (<= ~d .cse19) .cse8 .cse10 .cse20 (<= .cse19 ~d) .cse2 .cse3 .cse16 .cse5 .cse6 .cse0 .cse17 .cse9) (and .cse14 .cse4 .cse11 .cse18 .cse15 .cse8 .cse10 .cse20 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9)))) [2018-09-30 23:46:03,241 INFO L422 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse4 (not (= ~e_c 1))) (.cse6 (not (= ~c2_st 0))) (.cse7 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (let ((.cse5 (+ ~t_b 2))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4 (= ~wb_pc 1) (<= ~data .cse5) .cse6 (<= 2 ~e_wl) .cse7 .cse8 (<= .cse5 ~data))) (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse4 .cse6 .cse7 .cse8 (< ~c (+ ~c_t 1))))) [2018-09-30 23:46:03,241 INFO L422 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse12 (+ ~t_b 2))) (let ((.cse5 (= ~wl_pc 1)) (.cse9 (<= ~c_t .cse12)) (.cse10 (<= ~c .cse12)) (.cse11 (<= .cse12 ~c_t)) (.cse14 (<= 2 ~c2_st)) (.cse15 (<= .cse12 ~c)) (.cse17 (<= ~data .cse12)) (.cse18 (<= .cse12 ~data)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse13 (<= 1 ~c2_pc)) (.cse4 (= ~c2_st 0)) (.cse6 (not (= ~e_c 1))) (.cse16 (= ~wb_pc 1)) (.cse19 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse4 .cse5 .cse6 .cse7 .cse8 (< ~c (+ ~c_t 1))) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse11 (<= ~d .cse12) .cse13 .cse14 .cse15 (<= .cse12 ~d) .cse5 .cse6 .cse16 .cse17 .cse7 .cse18 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse11 .cse13 .cse14 .cse15 .cse6 .cse16 .cse17 .cse19 .cse7 .cse18 .cse8) (let ((.cse20 (+ ~t_b 1))) (and .cse0 .cse1 .cse2 .cse3 .cse13 (<= ~data .cse20) .cse4 .cse6 .cse16 .cse19 .cse7 .cse8 (<= .cse20 ~data)))))) [2018-09-30 23:46:03,241 INFO L422 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse10 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse7 (<= ~c_t .cse10)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse8 (<= ~c .cse10)) (.cse9 (<= .cse10 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse15 (<= 2 ~c2_st)) (.cse11 (<= .cse10 ~c)) (.cse1 (not (= ~e_c 1))) (.cse16 (= ~wb_pc 1)) (.cse12 (<= ~data .cse10)) (.cse17 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse13 (<= .cse10 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and (let ((.cse0 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~t_b ~data) .cse5 (<= ~data ~t_b) .cse6 (= ~wb_pc 0) (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) (and .cse7 .cse2 .cse3 .cse8 .cse4 .cse9 (<= ~d .cse10) .cse5 .cse11 (<= .cse10 ~d) .cse0 .cse1 .cse12 .cse6 .cse13))) .cse14 .cse15) (and .cse7 .cse2 .cse3 .cse4 .cse9 .cse5 .cse15 .cse1 .cse16 .cse12 .cse17 .cse14 .cse13 .cse6) (and .cse7 .cse2 .cse3 .cse8 .cse9 .cse5 .cse15 .cse11 .cse1 .cse16 .cse12 .cse17 .cse14 .cse13 .cse6)))) [2018-09-30 23:46:03,242 INFO L422 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (and (<= 2 ~c1_st) (let ((.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~e_wl)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= .cse0 ~d) .cse1 .cse2 .cse3 .cse4 (<= ~c .cse0) .cse5 (<= ~d .cse0) .cse6 .cse7 (<= .cse0 ~c))) (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (<= 2 ~c2_st)) [2018-09-30 23:46:03,242 INFO L422 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse5 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse4 (= ~wb_pc 1)) (.cse2 (<= 2 ~e_wl)) (.cse7 (<= 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 .cse3 (< ~c (+ ~c_t 1))) (and (and (= ~wl_pc 1) .cse1 .cse4 .cse5 .cse2 .cse0 .cse6 .cse3) .cse7 .cse8) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse5 (<= ~c .cse9) .cse0 (<= .cse9 ~c_t) (<= ~d .cse9) .cse6 .cse8 (<= .cse9 ~c) (<= .cse9 ~d) .cse1 .cse4 (<= ~data .cse9) .cse2 .cse7 (<= .cse9 ~data) .cse3)))) [2018-09-30 23:46:03,242 INFO L422 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-09-30 23:46:03,242 INFO L422 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse6 (<= 2 ~r_st)) (.cse5 (= ~wl_st 0)) (.cse3 (<= 1 ~c1_pc)) (.cse7 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse4 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and .cse6 (<= ~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 .cse4 .cse5 .cse8 (< ~c (+ ~c_t 1))) (let ((.cse10 (+ ~t_b 2))) (and (<= ~c_t .cse10) .cse3 (<= 2 ~wl_st) (<= ~c .cse10) (<= .cse10 ~c_t) .cse7 .cse9 (<= .cse10 ~c) .cse1 .cse2 (<= ~data .cse10) .cse4 .cse0 (<= .cse10 ~data) .cse8)))) [2018-09-30 23:46:03,243 INFO L422 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse6 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse6)) (.cse2 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse9 (<= .cse6 ~c)) (.cse12 (= ~wb_pc 1)) (.cse13 (<= ~data .cse6)) (.cse17 (<= 2 ~e_wl)) (.cse16 (<= .cse6 ~data)) (.cse1 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 2 ~r_st)) (.cse7 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse10 (= ~wl_pc 1)) (.cse11 (not (= ~e_c 1))) (.cse14 (<= 2 ~c1_st)) (.cse15 (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 .cse11 .cse12 .cse1 .cse13 .cse3 .cse17 .cse5 .cse14 .cse7 .cse8 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse1 .cse3 .cse5 (<= ~t_b ~data) .cse7 (<= ~data ~t_b) .cse8 (= ~wb_pc 0) (<= ~c_t ~c) .cse10 .cse11 .cse14 .cse15 (< ~c (+ ~c_t 1)))))) [2018-09-30 23:46:03,243 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse8 (<= ~c_t .cse14)) (.cse3 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and .cse1 .cse2 (= ~wl_pc 1) .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) .cse7) (= ~wl_pc 0) (and .cse8 .cse3 .cse9 .cse4 .cse10 .cse5 .cse7 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6) (and .cse8 .cse3 .cse9 (<= ~c .cse14) .cse10 .cse5 .cse7 (<= .cse14 ~c) .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-09-30 23:46:03,243 INFO L422 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse8 (<= ~c_t .cse14)) (.cse3 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~wl_pc 0) .cse6) (and .cse8 .cse3 .cse9 .cse4 .cse10 .cse5 .cse7 .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6) (and .cse8 .cse3 .cse9 (<= ~c .cse14) .cse10 .cse5 .cse7 (<= .cse14 ~c) .cse1 .cse2 .cse11 .cse12 .cse0 .cse13 .cse6)))) [2018-09-30 23:46:03,243 INFO L422 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (<= ~data ~t_b)) (.cse6 (not (= ~e_c 0))) (.cse7 (not (= ~c1_st 0)))) (or (and .cse0 .cse1 .cse2 (= ~wb_st 0) .cse3 (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 .cse7 (< ~c (+ ~c_t 1))) (and .cse4 .cse5 (= ~wb_pc 1) (<= 1 ~c1_pc) (<= 2 ~e_wl) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) .cse3 .cse6 .cse7))) [2018-09-30 23:46:03,244 INFO L422 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse9 (<= ~c_t .cse14)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse10 (<= .cse14 ~c_t)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse11 (<= ~data .cse14)) (.cse12 (<= 2 ~e_wl)) (.cse7 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1)) (<= ~c_t ~c)) .cse7 .cse8) (and .cse9 .cse2 .cse3 .cse4 .cse10 .cse5 .cse8 .cse0 .cse1 .cse11 .cse12 .cse7 .cse13 .cse6) (and .cse9 .cse2 .cse3 (<= ~c .cse14) .cse10 .cse5 .cse8 (<= .cse14 ~c) .cse0 .cse1 .cse11 .cse12 .cse7 .cse13 .cse6)))) [2018-09-30 23:46:03,244 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-09-30 23:46:03,244 INFO L422 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (= ~wb_st 0)) (.cse3 (= ~c2_st 0)) (.cse4 (not (= ~e_c 1))) (.cse5 (not (= ~e_c 0))) (.cse6 (not (= ~c1_st 0)))) (or (and .cse0 .cse1 (<= ~t_b ~data) .cse2 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse3 (= ~wl_pc 1) .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1))) (let ((.cse7 (+ ~t_b 1))) (and (<= 1 ~c1_pc) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) (<= ~data .cse7) .cse3 .cse4 (= ~wb_pc 1) (<= 2 ~e_wl) .cse5 .cse6 (<= .cse7 ~data))))) [2018-09-30 23:46:03,244 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse1 (not (= ~e_c 1))) (.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse2 (= ~wb_pc 1)) (.cse0 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (let ((.cse9 (+ ~t_b 2))) (and .cse3 .cse8 (<= ~c .cse9) .cse5 .cse7 (<= .cse9 ~c) (<= ~c_t ~c) .cse2 (<= ~data .cse9) (<= 2 ~e_wl) .cse0 (<= .cse9 ~data) .cse6 (< ~c (+ ~c_t 1)))))) [2018-09-30 23:46:03,244 INFO L422 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse4 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse15 (not (= ~e_c 0)))) (let ((.cse2 (or (and .cse10 .cse11 .cse4 .cse5 .cse7 .cse8 .cse15) (and .cse10 .cse11 (= ~wl_pc 1) .cse4 .cse7 .cse8 .cse15))) (.cse6 (<= ~c .cse14)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse14 ~c)) (.cse12 (<= ~data .cse14)) (.cse3 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse13 (<= .cse14 ~data))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 (< ~c (+ ~c_t 1))) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse4 .cse5 .cse6 (<= .cse14 ~c_t) .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse3 .cse0 .cse13 .cse15)))) [2018-09-30 23:46:03,245 INFO L422 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse13 (+ ~t_b 2))) (let ((.cse6 (= ~wl_pc 1)) (.cse5 (= ~c2_st 0)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (= ~c1_st 0)) (.cse4 (<= ~data ~t_b)) (.cse9 (<= ~c_t .cse13)) (.cse10 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~wl_st)) (.cse11 (<= ~c .cse13)) (.cse12 (<= .cse13 ~c_t)) (.cse14 (<= 1 ~c2_pc)) (.cse15 (<= 2 ~c2_st)) (.cse16 (<= .cse13 ~c)) (.cse7 (not (= ~e_c 1))) (.cse17 (= ~wb_pc 1)) (.cse18 (<= ~data .cse13)) (.cse21 (<= 2 ~e_wl)) (.cse19 (<= 2 ~c1_st)) (.cse20 (<= .cse13 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~wb_st 0) .cse4 (= ~wb_pc 0) (<= ~c_t ~c) .cse5 .cse6 .cse7 .cse8 (< ~c (+ ~c_t 1))) (and .cse9 .cse10 .cse0 .cse11 .cse1 .cse12 (<= ~d .cse13) .cse14 .cse15 .cse16 (<= .cse13 ~d) .cse6 .cse7 .cse17 .cse18 .cse19 .cse20 .cse8) (and .cse5 .cse7 .cse17 .cse10 .cse21 .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse12 .cse14 .cse15 .cse16 .cse7 .cse17 .cse18 .cse21 .cse19 .cse20 .cse8)))) [2018-09-30 23:46:03,245 INFO L422 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse19 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 1)) (.cse13 (<= ~c_t ~c)) (.cse12 (< ~c (+ ~c_t 1))) (.cse7 (<= 2 ~r_st)) (.cse6 (= ~wl_st 0)) (.cse14 (<= ~c_t .cse19)) (.cse4 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~wl_st)) (.cse18 (<= ~c .cse19)) (.cse15 (<= .cse19 ~c_t)) (.cse8 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse20 (<= .cse19 ~c)) (.cse2 (not (= ~e_c 1))) (.cse3 (= ~wb_pc 1)) (.cse16 (<= ~data .cse19)) (.cse5 (<= 2 ~e_wl)) (.cse0 (<= 2 ~c1_st)) (.cse17 (<= .cse19 ~data)) (.cse9 (not (= ~e_c 0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse9 .cse12 .cse13) .cse0 .cse10) (and .cse14 .cse4 .cse11 .cse7 .cse15 .cse8 .cse10 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9) (and .cse7 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse13 (= ~c2_st 0) .cse2 .cse5 .cse6 .cse9 .cse12) (and .cse14 .cse4 .cse18 .cse7 .cse15 (<= ~d .cse19) .cse8 .cse10 .cse20 (<= .cse19 ~d) .cse2 .cse3 .cse16 .cse5 .cse6 .cse0 .cse17 .cse9) (and .cse14 .cse4 .cse11 .cse18 .cse15 .cse8 .cse10 .cse20 .cse2 .cse3 .cse16 .cse5 .cse0 .cse17 .cse9)))) [2018-09-30 23:46:03,245 INFO L422 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse6 (+ ~t_b 2))) (let ((.cse10 (= ~wl_pc 1)) (.cse4 (<= 2 ~r_st)) (.cse17 (= ~wb_st 0)) (.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 (<= ~t_b ~data) .cse17 .cse7 (<= ~data ~t_b) .cse8 (= ~wb_pc 0) (<= ~c_t ~c) .cse10 .cse11 .cse14 .cse16 (< ~c (+ ~c_t 1))) (and .cse1 .cse2 .cse4 .cse17 .cse7 .cse8 .cse11 .cse12 .cse13 .cse18 .cse14 .cse16 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16)))) [2018-09-30 23:46:03,245 INFO L422 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse4 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse0 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 (and (= ~wl_pc 1) .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7 (= ~e_wl 1)) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse3 .cse8 (<= ~c .cse9) (<= .cse9 ~c_t) .cse5 .cse7 (<= .cse9 ~c) .cse1 .cse2 (<= ~data .cse9) (<= 2 ~e_wl) .cse0 (<= .cse9 ~data) .cse6)))) [2018-09-30 23:46:03,246 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-09-30 23:46:03,246 INFO L422 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse14 (+ ~t_b 2)) (.cse3 (<= 2 ~wl_st)) (.cse15 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse13 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse15 .cse9 .cse2 .cse3 .cse5 .cse6 .cse13) (and .cse15 .cse9 (= ~wl_pc 1) .cse2 .cse5 .cse6 .cse13))) (.cse4 (<= ~c .cse14)) (.cse7 (<= 2 ~c2_st)) (.cse8 (<= .cse14 ~c)) (.cse10 (<= ~data .cse14)) (.cse0 (<= 2 ~e_wl)) (.cse11 (<= 2 ~c1_st)) (.cse12 (<= .cse14 ~data))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_t ~c) .cse9 .cse10 .cse0 .cse11 .cse12 .cse13 (< ~c (+ ~c_t 1))) (and .cse11 .cse1 .cse7) (= ~wl_pc 0) (and (<= ~c_t .cse14) .cse2 .cse3 .cse4 (<= .cse14 ~c_t) .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse0 .cse11 .cse12 .cse13)))) [2018-09-30 23:46:03,246 INFO L422 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse3 (not (= ~e_c 1))) (.cse4 (not (= ~c2_st 0))) (.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse5 (<= 2 ~c1_st)) (.cse6 (not (= ~e_c 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 .cse4 .cse5 .cse6 (< ~c (+ ~c_t 1))) (let ((.cse7 (+ ~t_b 1))) (and (= ~wb_pc 1) .cse3 .cse4 .cse0 (<= 2 ~e_wl) .cse1 .cse2 .cse5 (<= 1 ~c2_pc) (<= ~data .cse7) .cse6 (<= .cse7 ~data))))) [2018-09-30 23:46:03,304 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:46:03 BoogieIcfgContainer [2018-09-30 23:46:03,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:46:03,305 INFO L168 Benchmark]: Toolchain (without parser) took 18189.61 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 225.4 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -123.4 MB). Peak memory consumption was 697.2 MB. Max. memory is 7.1 GB. [2018-09-30 23:46:03,306 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:46:03,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:46:03,307 INFO L168 Benchmark]: Boogie Preprocessor took 32.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:46:03,307 INFO L168 Benchmark]: RCFGBuilder took 745.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 23:46:03,308 INFO L168 Benchmark]: TraceAbstraction took 17358.07 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 225.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -155.1 MB). Peak memory consumption was 665.5 MB. Max. memory is 7.1 GB. [2018-09-30 23:46:03,317 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.19 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 46.25 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 32.10 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 745.06 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 17358.07 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 225.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -155.1 MB). Peak memory consumption was 665.5 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 <= ~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))))) || ((((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && ~c < ~c_t + 1)) || ~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)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((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) || (((((((((((((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) && !(~e_c == 0)) && ~c < ~c_t + 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: 331]: Loop Invariant Derived loop invariant: ((((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~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: 225]: 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))))) || ((((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && ~c < ~c_t + 1)) || ~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)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((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) || ((((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((!(~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)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((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) && !(~c2_st == 0)) && 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) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c2_st == 0)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && ~wb_pc == 0) && ~c < ~c_t + 1) && ~c_t <= ~c) || ((((((((((((((~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)) && 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: ((((((((((((((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)) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((((((((((~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))) || (((((((((((~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) && ~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: ((((((((((((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)) && !(~e_c == 0)) && !(~c1_st == 0)) && ~c < ~c_t + 1) || ((((((((((((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) && !(~e_c == 0)) && !(~c1_st == 0)) && ~t_b + 1 <= ~data) - 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)) && !(~e_c == 0)) && !(~c1_st == 0)) && ~c < ~c_t + 1) || (((((((((((~c2_st == 0 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && !(~c1_st == 0)) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((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) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 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) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((~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 <= ~c1_st) && 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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((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) || ((((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((!(~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)) - 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) && !(~e_c == 0)) && ~t_b + 2 <= ~c) || (((((((~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: ((((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) || ((((((!(~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)) - InvariantResult [Line: 339]: 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))))) || ((((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ~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)) - 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)) || ((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) && 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: 422]: Loop Invariant Derived loop invariant: ((((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) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((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) || (((((((((((((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) && !(~e_c == 0)) && ~c < ~c_t + 1)) || (((((((((((((((((~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))) || ((((((((((((((~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: 328]: Loop Invariant Derived loop invariant: (((((((((((((((((((~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) || (((((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~data <= ~t_b + 2) && 2 <= ~wl_st) && 2 <= ~e_wl) && 2 <= ~r_st) && 2 <= ~c1_st) && 1 <= ~c2_pc) && 2 <= ~c2_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)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((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) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~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))) || (((((((((((((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) && !(~e_c == 0)) && ~c < ~c_t + 1)) || (((((((((((((((((~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))) || ((((((((((((((~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: 161]: Loop Invariant Derived loop invariant: ((((((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) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~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))) || (((((((((((((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) && !(~e_c == 0)) && ~c < ~c_t + 1)) || (((((((((((((((((~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))) || ((((((((((((((~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: 172]: Loop Invariant Derived loop invariant: ((((2 <= ~c1_st && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 2 <= ~c2_st) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && ~wl_pc == 0) && !(~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))) || ((((((((((((((~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) && ~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)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((((((((((((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)) || ((((((((((((((~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)) && !(~c2_st == 0)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((((~wb_pc == 1 && !(~e_c == 1)) && !(~c2_st == 0)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~wl_st) && 2 <= ~r_st) && 2 <= ~c1_st) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && !(~e_c == 0)) && ~t_b + 1 <= ~data) - InvariantResult [Line: 387]: 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)))) || ((((((((((((((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) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && ~c < ~c_t + 1)) || ((2 <= ~c1_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 <= ~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)) - 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)) && 2 <= ~c1_st) && !(~e_c == 0)) && ~c < ~c_t + 1) || (((((((((((((((((~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: ((((2 <= ~c1_st && (((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c < ~c_t + 1) && ~c_t <= ~c) && 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, 17.2s OverallTime, 19 OverallIterations, 8 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 8.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1102 SDtfs, 689 SDslu, 1182 SDs, 0 SdLazy, 242 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.3s 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, 4954 HoareAnnotationTreeSize, 29 FomulaSimplifications, 9687 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 4647 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1233 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 201498 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-46-03-358.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-46-03-358.csv Received shutdown request...