java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:47:43,941 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:47:43,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:47:43,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:47:43,960 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:47:43,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:47:43,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:47:43,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:47:43,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:47:43,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:47:43,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:47:43,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:47:43,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:47:43,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:47:43,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:47:43,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:47:43,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:47:43,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:47:43,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:47:43,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:47:43,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:47:43,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:47:43,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:47:43,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:47:43,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:47:43,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:47:43,986 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:47:43,987 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:47:43,988 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:47:43,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:47:43,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:47:43,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:47:43,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:47:43,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:47:43,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:47:43,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:47:43,992 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:47:44,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:47:44,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:47:44,009 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:47:44,009 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:47:44,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:47:44,010 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:47:44,010 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:47:44,010 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:47:44,011 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:47:44,011 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:47:44,011 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:47:44,011 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:47:44,011 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:47:44,012 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:47:44,012 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:47:44,012 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:47:44,012 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:47:44,012 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:47:44,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:47:44,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:47:44,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:47:44,013 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:47:44,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:44,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:47:44,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:47:44,014 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:47:44,014 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:47:44,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:47:44,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:47:44,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:47:44,015 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:47:44,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:47:44,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:47:44,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:47:44,102 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:47:44,103 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:47:44,104 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 20:47:44,104 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-09-30 20:47:44,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:47:44,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:47:44,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:44,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:47:44,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:47:44,218 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,234 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:44,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:47:44,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:47:44,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:47:44,255 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,255 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,259 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,259 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,273 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,276 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,283 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 08:47:44" (1/1) ... [2018-09-30 20:47:44,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:47:44,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:47:44,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:47:44,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:47:44,296 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 08:47:44" (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 20:47:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:47:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:47:45,068 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:47:45,069 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:45 BoogieIcfgContainer [2018-09-30 20:47:45,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:47:45,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:47:45,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:47:45,074 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:47:45,074 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 08:47:44" (1/2) ... [2018-09-30 20:47:45,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adb974b and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:47:45, skipping insertion in model container [2018-09-30 20:47:45,076 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 08:47:45" (2/2) ... [2018-09-30 20:47:45,077 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-09-30 20:47:45,087 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:47:45,095 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:47:45,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:47:45,145 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:47:45,145 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:47:45,145 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:47:45,145 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:47:45,146 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:47:45,146 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:47:45,146 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:47:45,146 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:47:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-30 20:47:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:47:45,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:45,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:45,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:45,181 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-09-30 20:47:45,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:45,368 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 20:47:45,370 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:45,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:45,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:45,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:45,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:45,390 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-09-30 20:47:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:45,550 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-09-30 20:47:45,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:45,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-30 20:47:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:45,571 INFO L225 Difference]: With dead ends: 82 [2018-09-30 20:47:45,571 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 20:47:45,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 20:47:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 20:47:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 20:47:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-09-30 20:47:45,624 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-09-30 20:47:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:45,625 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-09-30 20:47:45,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-09-30 20:47:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:47:45,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:45,627 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:45,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:45,627 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:45,627 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-09-30 20:47:45,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:45,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:45,688 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 20:47:45,688 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:45,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:45,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:45,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:45,691 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-09-30 20:47:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:45,960 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-09-30 20:47:45,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:45,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-30 20:47:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:45,962 INFO L225 Difference]: With dead ends: 98 [2018-09-30 20:47:45,962 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 20:47:45,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 20:47:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-30 20:47:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 20:47:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-09-30 20:47:45,978 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-09-30 20:47:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:45,978 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-09-30 20:47:45,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-09-30 20:47:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:47:45,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:45,982 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:45,982 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:45,986 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-09-30 20:47:45,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:45,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:46,060 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 20:47:46,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:46,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:46,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:46,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:46,062 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-09-30 20:47:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:46,181 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-09-30 20:47:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:46,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 20:47:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:46,186 INFO L225 Difference]: With dead ends: 105 [2018-09-30 20:47:46,186 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 20:47:46,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 20:47:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 20:47:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 20:47:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-09-30 20:47:46,209 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-09-30 20:47:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:46,211 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-09-30 20:47:46,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-09-30 20:47:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:47:46,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:46,214 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 20:47:46,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:46,215 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-09-30 20:47:46,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:46,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:46,322 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 20:47:46,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:46,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:46,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:46,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:46,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:46,324 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-09-30 20:47:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:46,449 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-09-30 20:47:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:46,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-09-30 20:47:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:46,451 INFO L225 Difference]: With dead ends: 122 [2018-09-30 20:47:46,451 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 20:47:46,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 20:47:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-30 20:47:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:47:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-09-30 20:47:46,465 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-09-30 20:47:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:46,465 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-09-30 20:47:46,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-09-30 20:47:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:47:46,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:46,467 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 20:47:46,467 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:46,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-09-30 20:47:46,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:46,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:46,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:46,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:46,525 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 20:47:46,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:46,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:46,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:46,526 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:46,526 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-09-30 20:47:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:46,766 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-09-30 20:47:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:46,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 20:47:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:46,769 INFO L225 Difference]: With dead ends: 145 [2018-09-30 20:47:46,769 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 20:47:46,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 20:47:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-30 20:47:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-30 20:47:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-09-30 20:47:46,794 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-09-30 20:47:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:46,795 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-09-30 20:47:46,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-09-30 20:47:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:47:46,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:46,802 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 20:47:46,802 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:46,803 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-09-30 20:47:46,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:46,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:46,889 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 20:47:46,890 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:46,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:46,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:46,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:46,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:46,891 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-09-30 20:47:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:47,049 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-09-30 20:47:47,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:47,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 20:47:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:47,051 INFO L225 Difference]: With dead ends: 235 [2018-09-30 20:47:47,051 INFO L226 Difference]: Without dead ends: 163 [2018-09-30 20:47:47,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-30 20:47:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-09-30 20:47:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-30 20:47:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-09-30 20:47:47,072 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-09-30 20:47:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:47,073 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-09-30 20:47:47,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-09-30 20:47:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 20:47:47,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:47,076 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 20:47:47,076 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:47,076 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-09-30 20:47:47,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:47,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:47,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:47,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:47,128 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 20:47:47,129 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:47,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:47,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:47,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:47,130 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-09-30 20:47:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:47,219 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-09-30 20:47:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:47,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 20:47:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:47,223 INFO L225 Difference]: With dead ends: 288 [2018-09-30 20:47:47,223 INFO L226 Difference]: Without dead ends: 164 [2018-09-30 20:47:47,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-30 20:47:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-30 20:47:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-30 20:47:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-09-30 20:47:47,248 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-09-30 20:47:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:47,248 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-09-30 20:47:47,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-09-30 20:47:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 20:47:47,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:47,251 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 20:47:47,251 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:47,251 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-09-30 20:47:47,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:47,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:47,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:47,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:47,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:47,322 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 20:47:47,322 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:47,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:47,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:47,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:47,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:47,324 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-09-30 20:47:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:48,004 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-09-30 20:47:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:48,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 20:47:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:48,006 INFO L225 Difference]: With dead ends: 312 [2018-09-30 20:47:48,006 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 20:47:48,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 20:47:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-30 20:47:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-30 20:47:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-09-30 20:47:48,030 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-09-30 20:47:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:48,030 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-09-30 20:47:48,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-09-30 20:47:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 20:47:48,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:48,033 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 20:47:48,033 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:48,033 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-09-30 20:47:48,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:48,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:48,115 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 20:47:48,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:48,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:48,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:48,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:48,117 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-09-30 20:47:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:48,352 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-09-30 20:47:48,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:48,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-09-30 20:47:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:48,355 INFO L225 Difference]: With dead ends: 345 [2018-09-30 20:47:48,355 INFO L226 Difference]: Without dead ends: 177 [2018-09-30 20:47:48,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-30 20:47:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-09-30 20:47:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 20:47:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-09-30 20:47:48,387 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-09-30 20:47:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:48,388 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-09-30 20:47:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-09-30 20:47:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 20:47:48,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:48,390 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 20:47:48,394 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:48,394 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-09-30 20:47:48,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:48,493 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 20:47:48,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:48,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:48,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:48,494 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:48,494 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-09-30 20:47:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:48,674 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-09-30 20:47:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:48,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-30 20:47:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:48,676 INFO L225 Difference]: With dead ends: 335 [2018-09-30 20:47:48,676 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 20:47:48,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 20:47:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-09-30 20:47:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-30 20:47:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-09-30 20:47:48,696 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-09-30 20:47:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:48,696 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-09-30 20:47:48,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-09-30 20:47:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 20:47:48,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:48,698 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 20:47:48,698 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:48,698 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-09-30 20:47:48,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:48,924 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 20:47:48,924 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:48,924 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 20:47:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:49,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:49,810 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 20:47:49,848 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:49,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-09-30 20:47:49,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:49,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:49,855 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 5 states. [2018-09-30 20:47:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:50,508 INFO L93 Difference]: Finished difference Result 451 states and 641 transitions. [2018-09-30 20:47:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:47:50,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-09-30 20:47:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:50,513 INFO L225 Difference]: With dead ends: 451 [2018-09-30 20:47:50,513 INFO L226 Difference]: Without dead ends: 293 [2018-09-30 20:47:50,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:47:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-30 20:47:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2018-09-30 20:47:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-30 20:47:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2018-09-30 20:47:50,553 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 52 [2018-09-30 20:47:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:50,554 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2018-09-30 20:47:50,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-09-30 20:47:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 20:47:50,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:50,555 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 20:47:50,555 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:50,556 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash -784981334, now seen corresponding path program 1 times [2018-09-30 20:47:50,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:50,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:50,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:50,712 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 20:47:50,713 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:50,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:50,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:50,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:50,714 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand 3 states. [2018-09-30 20:47:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:51,056 INFO L93 Difference]: Finished difference Result 726 states and 990 transitions. [2018-09-30 20:47:51,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:51,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-30 20:47:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:51,061 INFO L225 Difference]: With dead ends: 726 [2018-09-30 20:47:51,061 INFO L226 Difference]: Without dead ends: 486 [2018-09-30 20:47:51,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-09-30 20:47:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 410. [2018-09-30 20:47:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-09-30 20:47:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2018-09-30 20:47:51,145 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 52 [2018-09-30 20:47:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:51,146 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2018-09-30 20:47:51,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2018-09-30 20:47:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 20:47:51,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:51,149 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 20:47:51,149 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:51,150 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1664618796, now seen corresponding path program 1 times [2018-09-30 20:47:51,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:51,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:51,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:51,240 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 20:47:51,240 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:51,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:51,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:51,242 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 3 states. [2018-09-30 20:47:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:51,825 INFO L93 Difference]: Finished difference Result 782 states and 1089 transitions. [2018-09-30 20:47:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:51,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-30 20:47:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:51,828 INFO L225 Difference]: With dead ends: 782 [2018-09-30 20:47:51,828 INFO L226 Difference]: Without dead ends: 404 [2018-09-30 20:47:51,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-09-30 20:47:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-09-30 20:47:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-09-30 20:47:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 556 transitions. [2018-09-30 20:47:51,899 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 556 transitions. Word has length 52 [2018-09-30 20:47:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:51,899 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 556 transitions. [2018-09-30 20:47:51,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 556 transitions. [2018-09-30 20:47:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 20:47:51,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:51,901 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 20:47:51,901 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:51,901 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash -232860399, now seen corresponding path program 1 times [2018-09-30 20:47:51,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:51,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:51,998 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 20:47:51,999 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:51,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:51,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:52,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:52,000 INFO L87 Difference]: Start difference. First operand 404 states and 556 transitions. Second operand 3 states. [2018-09-30 20:47:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:52,600 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-09-30 20:47:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:52,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-09-30 20:47:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:52,602 INFO L225 Difference]: With dead ends: 581 [2018-09-30 20:47:52,602 INFO L226 Difference]: Without dead ends: 192 [2018-09-30 20:47:52,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-30 20:47:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2018-09-30 20:47:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-30 20:47:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-09-30 20:47:52,635 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 61 [2018-09-30 20:47:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-09-30 20:47:52,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-09-30 20:47:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 20:47:52,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:52,637 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 20:47:52,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:52,637 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:52,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-09-30 20:47:52,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:52,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:52,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:52,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:52,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:52,797 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 20:47:52,798 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:52,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:52,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:52,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:52,799 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 3 states. [2018-09-30 20:47:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:53,382 INFO L93 Difference]: Finished difference Result 430 states and 550 transitions. [2018-09-30 20:47:53,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:53,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-09-30 20:47:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:53,384 INFO L225 Difference]: With dead ends: 430 [2018-09-30 20:47:53,384 INFO L226 Difference]: Without dead ends: 273 [2018-09-30 20:47:53,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-30 20:47:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-09-30 20:47:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-30 20:47:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2018-09-30 20:47:53,426 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 75 [2018-09-30 20:47:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:53,426 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2018-09-30 20:47:53,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2018-09-30 20:47:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 20:47:53,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:53,428 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 20:47:53,428 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:53,428 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:53,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-09-30 20:47:53,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:53,931 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 20:47:53,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:53,936 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) [2018-09-30 20:47:53,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:47:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:54,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:54,900 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 20:47:54,920 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:47:54,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-30 20:47:54,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:47:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:47:54,921 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:54,921 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2018-09-30 20:47:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:57,048 INFO L93 Difference]: Finished difference Result 1096 states and 1350 transitions. [2018-09-30 20:47:57,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:47:57,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-09-30 20:47:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:57,057 INFO L225 Difference]: With dead ends: 1096 [2018-09-30 20:47:57,057 INFO L226 Difference]: Without dead ends: 840 [2018-09-30 20:47:57,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-09-30 20:47:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-09-30 20:47:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 457. [2018-09-30 20:47:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-09-30 20:47:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2018-09-30 20:47:57,142 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 75 [2018-09-30 20:47:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:57,142 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2018-09-30 20:47:57,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:47:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2018-09-30 20:47:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-30 20:47:57,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:57,144 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 20:47:57,144 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:57,144 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash 44732949, now seen corresponding path program 1 times [2018-09-30 20:47:57,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:57,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:57,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:57,195 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 20:47:57,195 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:57,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:57,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:57,196 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:57,196 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 3 states. [2018-09-30 20:47:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:57,341 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-09-30 20:47:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:57,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-09-30 20:47:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:57,343 INFO L225 Difference]: With dead ends: 702 [2018-09-30 20:47:57,343 INFO L226 Difference]: Without dead ends: 259 [2018-09-30 20:47:57,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-30 20:47:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-09-30 20:47:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 20:47:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2018-09-30 20:47:57,383 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 82 [2018-09-30 20:47:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2018-09-30 20:47:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2018-09-30 20:47:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 20:47:57,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:57,385 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 20:47:57,386 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:57,386 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 2 times [2018-09-30 20:47:57,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:57,581 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 20:47:57,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:57,582 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 20:47:57,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:47:57,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:47:57,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:47:57,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:57,927 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 20:47:57,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:57,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 20:47:57,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:57,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:57,951 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:57,951 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand 5 states. [2018-09-30 20:47:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:58,271 INFO L93 Difference]: Finished difference Result 549 states and 665 transitions. [2018-09-30 20:47:58,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:47:58,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-09-30 20:47:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:58,273 INFO L225 Difference]: With dead ends: 549 [2018-09-30 20:47:58,273 INFO L226 Difference]: Without dead ends: 306 [2018-09-30 20:47:58,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:47:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-30 20:47:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-30 20:47:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-30 20:47:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2018-09-30 20:47:58,313 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 102 [2018-09-30 20:47:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:58,313 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2018-09-30 20:47:58,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2018-09-30 20:47:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 20:47:58,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:58,315 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 20:47:58,315 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:58,315 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2108568021, now seen corresponding path program 3 times [2018-09-30 20:47:58,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:58,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:47:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:58,414 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 20:47:58,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:58,414 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 20:47:58,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:47:58,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 20:47:58,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:47:58,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:58,512 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 20:47:58,532 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:58,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-09-30 20:47:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:47:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:47:58,534 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:58,534 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 4 states. [2018-09-30 20:47:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:58,636 INFO L93 Difference]: Finished difference Result 397 states and 473 transitions. [2018-09-30 20:47:58,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:47:58,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-09-30 20:47:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:58,637 INFO L225 Difference]: With dead ends: 397 [2018-09-30 20:47:58,638 INFO L226 Difference]: Without dead ends: 160 [2018-09-30 20:47:58,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-30 20:47:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-30 20:47:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-30 20:47:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2018-09-30 20:47:58,678 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 102 [2018-09-30 20:47:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:58,679 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2018-09-30 20:47:58,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:47:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2018-09-30 20:47:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-30 20:47:58,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:58,680 INFO L375 BasicCegarLoop]: trace histogram [9, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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 20:47:58,681 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:58,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1804980960, now seen corresponding path program 4 times [2018-09-30 20:47:58,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:58,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:58,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:47:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 177 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-30 20:47:58,909 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:58,909 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:47:58,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:47:59,026 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:47:59,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:47:59,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 20:47:59,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:59,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 20:47:59,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:59,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:59,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:59,184 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand 5 states. [2018-09-30 20:47:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:59,260 INFO L93 Difference]: Finished difference Result 231 states and 259 transitions. [2018-09-30 20:47:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:47:59,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-09-30 20:47:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:59,260 INFO L225 Difference]: With dead ends: 231 [2018-09-30 20:47:59,260 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:47:59,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:47:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:47:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:47:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:47:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:47:59,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-09-30 20:47:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:59,262 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:47:59,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:47:59,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:47:59,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:47:59,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:59,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:48:01,242 WARN L178 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-09-30 20:48:02,092 WARN L178 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-09-30 20:48:02,412 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2018-09-30 20:48:04,442 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2018-09-30 20:48:04,825 WARN L178 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-09-30 20:48:05,088 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-09-30 20:48:05,592 WARN L178 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-09-30 20:48:05,810 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-09-30 20:48:05,963 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-09-30 20:48:06,271 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-09-30 20:48:06,519 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-09-30 20:48:06,865 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-09-30 20:48:07,110 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-09-30 20:48:07,328 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-09-30 20:48:07,481 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-09-30 20:48:07,825 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-09-30 20:48:08,082 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-09-30 20:48:08,371 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-09-30 20:48:08,796 WARN L178 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-09-30 20:48:08,996 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-09-30 20:48:09,520 WARN L178 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-09-30 20:48:11,326 WARN L178 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-09-30 20:48:11,630 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-09-30 20:48:11,840 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-09-30 20:48:11,963 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-09-30 20:48:12,373 WARN L178 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-09-30 20:48:13,071 WARN L178 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-09-30 20:48:13,329 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-09-30 20:48:13,332 INFO L422 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse17 (+ ~t_b 2))) (let ((.cse9 (<= ~c_t .cse17)) (.cse2 (<= 1 ~c1_pc)) (.cse10 (= ~wl_pc 2)) (.cse11 (<= ~c .cse17)) (.cse12 (<= .cse17 ~c_t)) (.cse13 (<= 1 ~processed)) (.cse6 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse14 (<= .cse17 ~c)) (.cse1 (= ~wb_pc 1)) (.cse15 (<= ~data .cse17)) (.cse16 (<= .cse17 ~data)) (.cse5 (<= 2 ~r_st)) (.cse0 (not (= ~e_c 1))) (.cse3 (<= 2 ~e_wl)) (.cse4 (= ~wl_st 0)) (.cse7 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (and .cse9 .cse2 .cse10 (<= 2 ~wl_st) .cse11 .cse12 .cse13 .cse6 .cse8 .cse14 .cse0 .cse1 .cse15 .cse3 .cse16 .cse7) (and .cse9 .cse2 .cse10 .cse11 .cse5 .cse12 .cse13 (<= ~d .cse17) .cse6 .cse8 .cse14 (<= .cse17 ~d) .cse0 .cse1 .cse15 .cse3 .cse4 .cse16 .cse7) (and .cse5 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse0 .cse3 .cse4 (< ~c (+ ~c_t 1)) .cse7)))) [2018-09-30 20:48:13,333 INFO L422 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse7 (<= 2 ~c2_st)) (.cse3 (<= 2 ~e_wl)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (= ~wl_st 0) .cse4 .cse5 .cse6) .cse7) (let ((.cse8 (+ ~t_b 2))) (and (<= ~c_t .cse8) .cse2 (= ~wl_pc 2) .cse9 (<= ~c .cse8) (<= .cse8 ~c_t) (<= 1 ~processed) .cse5 .cse7 (<= .cse8 ~c) .cse0 .cse1 (<= ~data .cse8) .cse3 (<= .cse8 ~data) .cse6)) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse6))) [2018-09-30 20:48:13,333 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2))) (let ((.cse4 (<= 2 ~r_st)) (.cse0 (<= 1 ~c1_pc)) (.cse2 (= ~wl_pc 2)) (.cse1 (<= 2 ~wl_st)) (.cse3 (<= ~c .cse15)) (.cse5 (<= 1 ~processed)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse8 (<= .cse15 ~c)) (.cse14 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse10 (<= ~data .cse15)) (.cse11 (<= 2 ~e_wl)) (.cse12 (<= .cse15 ~data)) (.cse13 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_t ~c) .cse9 .cse10 .cse11 (< ~c (+ ~c_t 1)) .cse12 .cse13) (and .cse14 .cse9 .cse0 .cse1 .cse4 .cse6 .cse13) (and (and (not (= ~c1_st 0)) (and (= ~wl_pc 1) .cse14 .cse9 .cse0 (= ~wl_st 0) .cse4 .cse6 .cse13) (= ~e_wl 1)) .cse7) (and (<= ~c_t .cse15) .cse0 .cse2 .cse1 .cse3 (<= .cse15 ~c_t) .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 (<= 2 ~c1_st) .cse12 .cse13)))) [2018-09-30 20:48:13,333 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-09-30 20:48:13,333 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-09-30 20:48:13,334 INFO L422 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse7 (+ ~t_b 2))) (let ((.cse0 (not (= ~e_c 1))) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse8 (= ~wl_pc 2)) (.cse10 (<= ~c .cse7)) (.cse3 (<= 2 ~r_st)) (.cse11 (<= 1 ~processed)) (.cse4 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse12 (<= .cse7 ~c)) (.cse1 (= ~wb_pc 1)) (.cse13 (<= ~data .cse7)) (.cse14 (<= 2 ~e_wl)) (.cse15 (<= .cse7 ~data)) (.cse5 (not (= ~e_c 0)))) (or (and (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse3 .cse4 .cse5) (= ~e_wl 1)) .cse6) (and (<= ~c_t .cse7) .cse2 .cse8 .cse9 .cse10 (<= .cse7 ~c_t) .cse11 .cse4 .cse6 .cse12 .cse0 .cse1 .cse13 .cse14 .cse15 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse2 .cse9 .cse8 .cse10 .cse3 .cse11 .cse4 .cse6 .cse12 (<= ~c_t ~c) .cse1 .cse13 .cse14 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse15 .cse5)))) [2018-09-30 20:48:13,334 INFO L422 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse2 (+ ~t_b 2)) (.cse5 (<= 2 ~wl_st)) (.cse11 (not (= ~e_c 1))) (.cse12 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse16 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse15 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse11 .cse12 .cse3 .cse5 .cse16 .cse8 .cse15) (and .cse11 .cse12 (= ~wl_pc 1) .cse3 .cse16 .cse8 .cse15))) (.cse4 (= ~wl_pc 2)) (.cse6 (<= ~c .cse2)) (.cse7 (<= 1 ~processed)) (.cse9 (<= 2 ~c2_st)) (.cse10 (<= .cse2 ~c)) (.cse13 (<= ~data .cse2)) (.cse0 (<= 2 ~e_wl)) (.cse14 (<= .cse2 ~data))) (or (and .cse0 .cse1) (and (<= ~c_t .cse2) .cse3 .cse4 .cse5 .cse6 (<= .cse2 ~c_t) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse0 .cse14 .cse15) (and .cse1 .cse9) (= ~wl_pc 0) (and .cse3 .cse5 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 (<= ~c_t ~c) .cse12 .cse13 .cse0 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse14 .cse15)))) [2018-09-30 20:48:13,334 INFO L422 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2)) (.cse3 (<= 2 ~wl_st)) (.cse10 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse6 (<= 2 ~r_st)) (.cse8 (<= 1 ~c2_pc)) (.cse16 (not (= ~e_c 0)))) (let ((.cse0 (or (and .cse10 .cse11 .cse2 .cse3 .cse6 .cse8 .cse16) (and .cse10 .cse11 (= ~wl_pc 1) .cse2 .cse6 .cse8 .cse16))) (.cse4 (= ~wl_pc 2)) (.cse5 (<= ~c .cse15)) (.cse7 (<= 1 ~processed)) (.cse1 (<= 2 ~c2_st)) (.cse9 (<= .cse15 ~c)) (.cse12 (<= ~data .cse15)) (.cse13 (<= 2 ~e_wl)) (.cse14 (<= .cse15 ~data))) (or (and (and (not (= ~c1_st 0)) .cse0) .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (<= ~c_t ~c) .cse10 .cse11 .cse12 .cse13 (< ~c (+ ~c_t 1)) .cse14) (and .cse13 .cse0) (= ~wl_pc 0) (and (<= ~c_t .cse15) .cse2 .cse4 .cse3 .cse5 (<= .cse15 ~c_t) .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~c1_st) .cse14 .cse16)))) [2018-09-30 20:48:13,334 INFO L422 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse7 (+ ~t_b 2))) (let ((.cse8 (= ~wl_pc 2)) (.cse10 (<= ~c .cse7)) (.cse11 (<= 1 ~processed)) (.cse6 (<= 2 ~c2_st)) (.cse12 (<= .cse7 ~c)) (.cse13 (<= ~data .cse7)) (.cse14 (<= 2 ~e_wl)) (.cse15 (<= .cse7 ~data)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse4 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0)))) (or (and (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse3 .cse4 .cse5) (= ~e_wl 1)) .cse6) (and (<= ~c_t .cse7) .cse2 .cse8 .cse9 .cse10 (<= .cse7 ~c_t) .cse11 .cse4 .cse6 .cse12 .cse0 .cse1 .cse13 .cse14 .cse15 .cse5) (and .cse2 .cse9 .cse8 .cse10 .cse11 .cse4 .cse6 .cse12 (<= ~c_t ~c) .cse1 .cse13 .cse14 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse15 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5)))) [2018-09-30 20:48:13,335 INFO L422 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse21 (+ ~t_b 2))) (let ((.cse0 (= ~wl_pc 1)) (.cse15 (<= ~c .cse21)) (.cse18 (<= .cse21 ~c)) (.cse9 (<= ~c_t ~c)) (.cse12 (= ~wl_st 0)) (.cse5 (< ~c (+ ~c_t 1))) (.cse13 (<= ~c_t .cse21)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~wl_st)) (.cse14 (= ~wl_pc 2)) (.cse6 (<= 2 ~r_st)) (.cse16 (<= .cse21 ~c_t)) (.cse17 (<= 1 ~processed)) (.cse7 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse19 (<= ~data .cse21)) (.cse11 (<= 2 ~e_wl)) (.cse20 (<= .cse21 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse6 .cse7 .cse8) .cse10) (and .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse17 .cse7 .cse10 .cse18 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8) (and .cse13 .cse3 .cse14 .cse15 .cse6 .cse16 .cse17 (<= ~d .cse21) .cse7 .cse10 .cse18 (<= .cse21 ~d) .cse1 .cse2 .cse19 .cse11 .cse12 .cse20 .cse8) (and .cse6 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse9 (= ~c2_st 0) .cse1 .cse11 .cse12 .cse5 .cse8) (and .cse13 .cse3 .cse4 .cse14 .cse6 .cse16 .cse17 .cse7 .cse10 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8)))) [2018-09-30 20:48:13,335 INFO L422 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse1 (<= 2 ~wl_st)) (.cse2 (<= 2 ~r_st)) (.cse3 (= ~wb_st 0)) (.cse4 (not (= ~e_c 1))) (.cse5 (not (= ~c2_st 0))) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 (<= ~t_b ~data) .cse3 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse4 (< ~c (+ ~c_t 1)) .cse5 .cse6) (let ((.cse7 (+ ~t_b 2))) (and .cse0 (= ~wl_pc 2) .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4 (= ~wb_pc 1) (<= ~data .cse7) (<= 2 ~e_wl) .cse5 .cse6 (<= .cse7 ~data))))) [2018-09-30 20:48:13,335 INFO L422 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse3 (<= 2 ~r_st)) (.cse4 (= ~wb_st 0)) (.cse7 (= ~c2_st 0)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (= ~wl_pc 2)) (.cse2 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse8 (not (= ~e_c 1))) (.cse9 (= ~wb_pc 1)) (.cse10 (<= 2 ~e_wl)) (.cse11 (not (= ~e_c 0)))) (or (let ((.cse6 (+ ~t_b 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~data .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse6 ~data))) (and .cse0 .cse2 .cse3 (<= ~t_b ~data) .cse4 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse7 (= ~wl_pc 1) .cse8 (< ~c (+ ~c_t 1)) .cse11) (let ((.cse12 (+ ~t_b 2))) (and (<= ~c_t .cse12) .cse0 .cse1 .cse2 (<= ~c .cse12) (<= .cse12 ~c_t) (<= 1 ~processed) .cse5 (<= 2 ~c2_st) (<= .cse12 ~c) .cse8 .cse9 (<= ~data .cse12) .cse10 (<= .cse12 ~data) .cse11)))) [2018-09-30 20:48:13,335 INFO L422 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse7 (+ ~t_b 2))) (let ((.cse4 (<= ~c .cse7)) (.cse9 (<= .cse7 ~c)) (.cse1 (<= ~c_t .cse7)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse15 (= ~wl_pc 2)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= .cse7 ~c_t)) (.cse16 (<= 1 ~processed)) (.cse8 (<= 1 ~c2_pc)) (.cse0 (<= 2 ~c2_st)) (.cse11 (not (= ~e_c 1))) (.cse17 (= ~wb_pc 1)) (.cse12 (<= ~data .cse7)) (.cse18 (<= 2 ~e_wl)) (.cse14 (<= .cse7 ~data)) (.cse13 (not (= ~e_c 0)))) (or (and .cse0 (let ((.cse10 (= ~wl_pc 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~d .cse7) .cse8 .cse9 (<= .cse7 ~d) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse11 .cse2 .cse3 .cse5 (< ~c (+ ~c_t 1)) (<= ~t_b ~data) .cse8 (<= ~data ~t_b) .cse13 (= ~wb_pc 0) (<= ~c_t ~c))))) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse8 .cse0 .cse9 .cse11 .cse17 .cse12 .cse18 .cse14 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse16 .cse8 .cse0 .cse11 .cse17 .cse12 .cse18 .cse14 .cse13)))) [2018-09-30 20:48:13,336 INFO L422 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (and (let ((.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~e_wl)) (.cse5 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= .cse0 ~d) .cse1 .cse2 .cse3 .cse4 (<= ~c .cse0) .cse5 (<= ~d .cse0) .cse6 (<= .cse0 ~c) .cse7)) (and (= ~wl_pc 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) (<= 2 ~c2_st)) [2018-09-30 20:48:13,336 INFO L422 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse2 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~r_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse3 (<= 2 ~e_wl)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse4 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse0 .cse3 (< ~c (+ ~c_t 1)) .cse6) (let ((.cse8 (+ ~t_b 2))) (and (<= ~c_t .cse8) .cse2 (= ~wl_pc 2) (<= ~c .cse8) .cse4 (<= .cse8 ~c_t) (<= 1 ~processed) (<= ~d .cse8) .cse5 .cse7 (<= .cse8 ~c) (<= .cse8 ~d) .cse0 .cse1 (<= ~data .cse8) .cse3 (<= .cse8 ~data) .cse6)))) [2018-09-30 20:48:13,336 INFO L422 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-09-30 20:48:13,336 INFO L422 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse2 (<= 1 ~c1_pc)) (.cse6 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse1 (= ~wb_pc 1)) (.cse5 (<= 2 ~r_st)) (.cse0 (not (= ~e_c 1))) (.cse3 (<= 2 ~e_wl)) (.cse4 (= ~wl_st 0)) (.cse7 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (let ((.cse9 (+ ~t_b 2))) (and (<= ~c_t .cse9) .cse2 (= ~wl_pc 2) (<= 2 ~wl_st) (<= ~c .cse9) (<= .cse9 ~c_t) (<= 1 ~processed) .cse6 .cse8 (<= .cse9 ~c) .cse0 .cse1 (<= ~data .cse9) .cse3 (<= .cse9 ~data) .cse7)) (and .cse5 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~c2_st 0) .cse0 .cse3 .cse4 (< ~c (+ ~c_t 1)) .cse7))) [2018-09-30 20:48:13,337 INFO L422 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse12 (+ ~t_b 2))) (let ((.cse7 (<= 2 ~r_st)) (.cse3 (<= 1 ~c1_pc)) (.cse5 (= ~wl_pc 2)) (.cse6 (<= 2 ~wl_st)) (.cse8 (<= 1 ~c2_pc)) (.cse9 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= ~data .cse12)) (.cse4 (<= 2 ~e_wl)) (.cse11 (not (= ~e_c 0))) (.cse10 (<= .cse12 ~data))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse6 .cse7 (<= ~t_b ~data) .cse8 (<= ~data ~t_b) .cse9 (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse0 (< ~c (+ ~c_t 1)) .cse11) (and (<= ~c_t .cse12) .cse3 .cse5 (<= ~c .cse12) .cse6 (<= .cse12 ~c_t) (<= 1 ~processed) .cse8 .cse9 (<= .cse12 ~c) .cse0 .cse1 .cse2 .cse4 .cse11 .cse10)))) [2018-09-30 20:48:13,337 INFO L422 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse4)) (.cse1 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse2 (= ~wl_pc 2)) (.cse15 (<= 2 ~r_st)) (.cse5 (<= .cse4 ~c_t)) (.cse6 (<= 1 ~processed)) (.cse7 (<= 1 ~c2_pc)) (.cse8 (<= 2 ~c2_st)) (.cse9 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse11 (<= ~data .cse4)) (.cse12 (<= 2 ~e_wl)) (.cse13 (<= .cse4 ~data)) (.cse14 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~c .cse4) .cse5 .cse6 .cse7 .cse8 (<= .cse4 ~c) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse8 (and .cse9 .cse10 (= ~wl_pc 1) .cse1 (< ~c (+ ~c_t 1)) .cse15 .cse7 .cse14 (<= ~c_t ~c))) (= ~wl_pc 0) (and .cse0 .cse1 .cse3 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2018-09-30 20:48:13,337 INFO L422 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse16 (+ ~t_b 2))) (let ((.cse3 (<= 2 ~r_st)) (.cse7 (<= ~c_t .cse16)) (.cse2 (<= 1 ~c1_pc)) (.cse9 (= ~wl_pc 2)) (.cse8 (<= 2 ~wl_st)) (.cse10 (<= .cse16 ~c_t)) (.cse11 (<= 1 ~processed)) (.cse4 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse12 (<= ~data .cse16)) (.cse13 (<= 2 ~e_wl)) (.cse14 (<= 2 ~c1_st)) (.cse15 (<= .cse16 ~data)) (.cse5 (not (= ~e_c 0)))) (or (and (and (not (= ~c1_st 0)) (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4 .cse5 (<= ~c_t ~c))) .cse6) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse6 .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~wl_pc 0) .cse5) (and .cse7 .cse2 .cse9 .cse8 (<= ~c .cse16) .cse10 .cse11 .cse4 .cse6 (<= .cse16 ~c) .cse0 .cse1 .cse12 .cse13 .cse14 .cse15 .cse5)))) [2018-09-30 20:48:13,337 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-09-30 20:48:13,337 INFO L422 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (<= ~t_b ~data)) (.cse3 (<= ~data ~t_b)) (.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse6 (not (= ~c1_st 0))) (.cse7 (not (= ~e_c 0)))) (or (and (<= 1 ~c1_pc) (= ~wl_pc 2) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) .cse3 .cse4 .cse5 (= ~wb_pc 1) .cse6 (<= 2 ~e_wl) .cse7) (and .cse0 .cse1 .cse2 (= ~wb_st 0) .cse3 (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7))) [2018-09-30 20:48:13,338 INFO L422 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse10 (+ ~t_b 2))) (let ((.cse8 (<= ~c_t .cse10)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse9 (= ~wl_pc 2)) (.cse4 (<= 2 ~r_st)) (.cse11 (<= .cse10 ~c_t)) (.cse12 (<= 1 ~processed)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse13 (<= ~data .cse10)) (.cse14 (<= 2 ~e_wl)) (.cse15 (<= .cse10 ~data)) (.cse6 (not (= ~e_c 0)))) (or (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 .cse3 (< ~c (+ ~c_t 1)) .cse4 .cse5 .cse6 (<= ~c_t ~c)) .cse7) (and .cse8 .cse2 .cse9 .cse3 (<= ~c .cse10) .cse11 .cse12 .cse5 .cse7 (<= .cse10 ~c) .cse0 .cse1 .cse13 .cse14 .cse15 .cse6) (and .cse8 .cse2 .cse3 .cse9 .cse4 .cse11 .cse12 .cse5 .cse7 .cse0 .cse1 .cse13 .cse14 .cse15 .cse6)))) [2018-09-30 20:48:13,338 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-09-30 20:48:13,338 INFO L422 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse0 (<= 2 ~wl_st)) (.cse1 (<= 2 ~r_st)) (.cse2 (= ~wb_st 0)) (.cse4 (= ~c2_st 0)) (.cse5 (not (= ~e_c 1))) (.cse6 (not (= ~c1_st 0))) (.cse7 (not (= ~e_c 0)))) (or (let ((.cse3 (+ ~t_b 1))) (and (<= 1 ~c1_pc) (= ~wl_pc 2) .cse0 .cse1 .cse2 (<= 1 ~c2_pc) (<= ~data .cse3) .cse4 .cse5 (= ~wb_pc 1) .cse6 (<= 2 ~e_wl) .cse7 (<= .cse3 ~data))) (and .cse0 .cse1 (<= ~t_b ~data) .cse2 (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) .cse4 (= ~wl_pc 1) .cse5 .cse6 (< ~c (+ ~c_t 1)) .cse7))) [2018-09-30 20:48:13,338 INFO L422 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse0 (not (= ~e_c 1))) (.cse4 (<= 2 ~r_st)) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~wl_st)) (.cse5 (<= 1 ~c2_pc)) (.cse7 (<= 2 ~c2_st)) (.cse1 (= ~wb_pc 1)) (.cse6 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (and (not (= ~c1_st 0)) (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse4 .cse5 .cse6) (= ~e_wl 1)) .cse7) (let ((.cse8 (+ ~t_b 2))) (and .cse2 .cse3 (= ~wl_pc 2) (<= ~c .cse8) (<= 1 ~processed) .cse5 .cse7 (<= .cse8 ~c) (<= ~c_t ~c) .cse1 (<= ~data .cse8) (<= 2 ~e_wl) (< ~c (+ ~c_t 1)) (<= .cse8 ~data) .cse6)))) [2018-09-30 20:48:13,338 INFO L422 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse1 (<= 2 ~wl_st)) (.cse9 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse0 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~r_st)) (.cse6 (<= 1 ~c2_pc)) (.cse16 (not (= ~e_c 0))) (.cse15 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse3 (<= ~c .cse15)) (.cse5 (<= 1 ~processed)) (.cse8 (<= .cse15 ~c)) (.cse11 (<= ~data .cse15)) (.cse12 (<= 2 ~e_wl)) (.cse13 (<= .cse15 ~data)) (.cse14 (or (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse16) (and .cse9 .cse10 (= ~wl_pc 1) .cse0 .cse4 .cse6 .cse16))) (.cse7 (<= 2 ~c2_st))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_t ~c) .cse9 .cse10 .cse11 .cse12 (< ~c (+ ~c_t 1)) (<= 2 ~c1_st) .cse13) (and .cse12 .cse14) (and (<= ~c_t .cse15) .cse0 .cse2 .cse1 .cse3 (<= .cse15 ~c_t) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (and .cse14 .cse7) (= ~wl_pc 0)))) [2018-09-30 20:48:13,339 INFO L422 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse3 (<= 2 ~r_st)) (.cse4 (<= ~t_b ~data)) (.cse5 (= ~c1_st 0)) (.cse7 (<= ~data ~t_b)) (.cse8 (= ~c2_st 0)) (.cse0 (<= 1 ~c1_pc)) (.cse1 (= ~wl_pc 2)) (.cse2 (<= 2 ~wl_st)) (.cse6 (<= 1 ~c2_pc)) (.cse9 (not (= ~e_c 1))) (.cse10 (= ~wb_pc 1)) (.cse11 (<= 2 ~e_wl)) (.cse12 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse5 (= ~wb_st 0) .cse7 (= ~wb_pc 0) (<= ~c_t ~c) .cse8 (= ~wl_pc 1) .cse9 (< ~c (+ ~c_t 1)) .cse12) (let ((.cse13 (+ ~t_b 2))) (and (<= ~c_t .cse13) .cse0 .cse1 .cse2 (<= ~c .cse13) (<= .cse13 ~c_t) (<= 1 ~processed) .cse6 (<= 2 ~c2_st) (<= .cse13 ~c) .cse9 .cse10 (<= ~data .cse13) .cse11 (<= 2 ~c1_st) (<= .cse13 ~data) .cse12)))) [2018-09-30 20:48:13,339 INFO L422 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse21 (+ ~t_b 2))) (let ((.cse0 (= ~wl_pc 1)) (.cse15 (<= ~c .cse21)) (.cse18 (<= .cse21 ~c)) (.cse9 (<= ~c_t ~c)) (.cse12 (= ~wl_st 0)) (.cse5 (< ~c (+ ~c_t 1))) (.cse13 (<= ~c_t .cse21)) (.cse3 (<= 1 ~c1_pc)) (.cse4 (<= 2 ~wl_st)) (.cse14 (= ~wl_pc 2)) (.cse6 (<= 2 ~r_st)) (.cse16 (<= .cse21 ~c_t)) (.cse17 (<= 1 ~processed)) (.cse7 (<= 1 ~c2_pc)) (.cse10 (<= 2 ~c2_st)) (.cse1 (not (= ~e_c 1))) (.cse2 (= ~wb_pc 1)) (.cse19 (<= ~data .cse21)) (.cse11 (<= 2 ~e_wl)) (.cse20 (<= .cse21 ~data)) (.cse8 (not (= ~e_c 0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse6 .cse7 .cse8) .cse10) (and .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse17 .cse7 .cse10 .cse18 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8) (and .cse13 .cse3 .cse14 .cse15 .cse6 .cse16 .cse17 (<= ~d .cse21) .cse7 .cse10 .cse18 (<= .cse21 ~d) .cse1 .cse2 .cse19 .cse11 .cse12 .cse20 .cse8) (and .cse6 (<= ~t_b ~data) (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) (<= ~data ~t_b) (= ~wb_pc 0) .cse9 (= ~c2_st 0) .cse1 .cse11 .cse12 .cse5 .cse8) (and .cse13 .cse3 .cse4 .cse14 .cse6 .cse16 .cse17 .cse7 .cse10 .cse1 .cse2 .cse19 .cse11 .cse20 .cse8)))) [2018-09-30 20:48:13,339 INFO L422 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse13 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 2)) (.cse8 (= ~wb_pc 1)) (.cse9 (<= ~data .cse13)) (.cse10 (<= 2 ~e_wl)) (.cse12 (<= .cse13 ~data)) (.cse0 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse4 (= ~wb_st 0)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (<= 2 ~c2_st)) (.cse7 (not (= ~e_c 1))) (.cse11 (not (= ~e_c 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ~c_t .cse13) .cse0 .cse1 .cse2 (<= ~c .cse13) (<= .cse13 ~c_t) (<= 1 ~processed) .cse5 .cse6 (<= .cse13 ~c) .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse0 .cse2 .cse3 (<= ~t_b ~data) .cse4 .cse5 (<= ~data ~t_b) .cse6 (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse7 (< ~c (+ ~c_t 1)) .cse11)))) [2018-09-30 20:48:13,339 INFO L422 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse6 (<= 2 ~c2_st)) (.cse0 (not (= ~e_c 1))) (.cse1 (= ~wb_pc 1)) (.cse2 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse4 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0)))) (or (and (and (and (= ~wl_pc 1) .cse0 .cse1 .cse2 (= ~wl_st 0) .cse3 .cse4 .cse5) (= ~e_wl 1)) .cse6) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse2 (= ~wl_pc 2) .cse8 (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse4 .cse6 (<= .cse7 ~c) .cse0 .cse1 (<= ~data .cse7) (<= 2 ~e_wl) (<= .cse7 ~data) .cse5)) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5))) [2018-09-30 20:48:13,339 INFO L422 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse15 (+ ~t_b 2)) (.cse4 (<= 2 ~wl_st)) (.cse16 (not (= ~e_c 1))) (.cse11 (= ~wb_pc 1)) (.cse3 (<= 1 ~c1_pc)) (.cse7 (<= 2 ~r_st)) (.cse9 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0)))) (let ((.cse1 (or (and .cse16 .cse11 .cse3 .cse4 .cse7 .cse9 .cse14) (and .cse16 .cse11 (= ~wl_pc 1) .cse3 .cse7 .cse9 .cse14))) (.cse5 (= ~wl_pc 2)) (.cse6 (<= ~c .cse15)) (.cse8 (<= 1 ~processed)) (.cse0 (<= 2 ~c2_st)) (.cse10 (<= .cse15 ~c)) (.cse12 (<= ~data .cse15)) (.cse2 (<= 2 ~e_wl)) (.cse13 (<= .cse15 ~data))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 (<= ~c_t ~c) .cse11 .cse12 .cse2 (< ~c (+ ~c_t 1)) .cse13 .cse14) (= ~wl_pc 0) (and (<= ~c_t .cse15) .cse3 .cse5 .cse4 .cse6 (<= .cse15 ~c_t) .cse8 .cse9 .cse0 .cse10 .cse16 .cse11 .cse12 .cse2 (<= 2 ~c1_st) .cse13 .cse14)))) [2018-09-30 20:48:13,340 INFO L422 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 2 ~wl_st)) (.cse3 (<= 2 ~r_st)) (.cse0 (not (= ~e_c 1))) (.cse5 (not (= ~c2_st 0))) (.cse4 (not (= ~e_c 0)))) (or (let ((.cse6 (+ ~t_b 1))) (and (and (= ~wb_pc 1) .cse0 .cse1 .cse2 .cse3 (<= 1 ~c2_pc) .cse4) (<= 2 ~e_wl) (= ~wl_pc 2) .cse5 (<= ~data .cse6) (<= .cse6 ~data))) (and .cse1 .cse2 .cse3 (<= ~t_b ~data) (= ~wb_st 0) (<= ~data ~t_b) (= ~wb_pc 0) (<= ~c_t ~c) (= ~wl_pc 1) .cse0 (< ~c (+ ~c_t 1)) .cse5 .cse4))) [2018-09-30 20:48:13,391 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:48:13 BoogieIcfgContainer [2018-09-30 20:48:13,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:48:13,392 INFO L168 Benchmark]: Toolchain (without parser) took 29200.11 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 209.2 MB). Free memory was 1.5 GB in the beginning and 927.1 MB in the end (delta: 544.3 MB). Peak memory consumption was 753.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:48:13,393 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 20:48:13,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.80 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 20:48:13,395 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 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 20:48:13,395 INFO L168 Benchmark]: RCFGBuilder took 781.01 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 20:48:13,396 INFO L168 Benchmark]: TraceAbstraction took 28320.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 209.2 MB). Free memory was 1.4 GB in the beginning and 927.1 MB in the end (delta: 512.6 MB). Peak memory consumption was 722.2 MB. Max. memory is 7.1 GB. [2018-09-30 20:48:13,401 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 47.80 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 43.91 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 781.01 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 28320.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 209.2 MB). Free memory was 1.4 GB in the beginning and 927.1 MB in the end (delta: 512.6 MB). Peak memory consumption was 722.2 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: (((((!(~c1_st == 0) && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)))) && 2 <= ~c2_st) || (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data)) || (2 <= ~e_wl && (((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))))) || ~wl_pc == 0) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 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: ((((((((((~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) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~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) && ~c < ~c_t + 1) && !(~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) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) || (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))))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~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 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((!(~c1_st == 0) && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st)) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 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) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~c2_st == 0)) && !(~e_c == 0)) || ((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~c2_st == 0)) && !(~e_c == 0)) && ~t_b + 2 <= ~data) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((2 <= ~c2_st && (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && ~wl_pc == 1) && !(~e_c == 1)) && ~data <= ~t_b + 2) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && ~c < ~c_t + 1) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && !(~e_c == 0)) && ~wb_pc == 0) && ~c_t <= ~c))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && 2 <= ~e_wl) && !(~e_c == 0)) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~wb_st == 0) && 1 <= ~c2_pc) && ~data <= ~t_b + 1) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && !(~c1_st == 0)) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 1 <= ~data) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c1_st == 0)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && ~c2_st == 0) && !(~e_c == 1)) && ~wb_pc == 1) && !(~c1_st == 0)) && 2 <= ~e_wl) && !(~e_c == 0)) || ((((((((((((2 <= ~wl_st && 2 <= ~r_st) && ~t_b <= ~data) && ~wb_st == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && !(~c1_st == 0)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: 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)) || (((!(~c1_st == 0) && ((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st)) || ((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((~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) || ((((((((((((2 <= ~r_st && ~t_b <= ~data) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~data <= ~t_b) && ~wb_pc == 0) && ~c_t <= ~c) && ~c2_st == 0) && !(~e_c == 1)) && 2 <= ~e_wl) && ~c < ~c_t + 1) && !(~e_c == 0))) || (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~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) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((~t_b + 2 <= ~d && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 0)) || (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0))) && 2 <= ~c2_st - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) - InvariantResult [Line: 339]: 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)))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) || ((((((!(~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) || ((((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((((~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) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && ~wl_st == 0) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~e_wl == 1) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || (((((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && 2 <= ~c1_st) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((!(~e_c == 1) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((~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) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~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) && ~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) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((!(~e_c == 1) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wl_pc == 2) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || ((((((((((((1 <= ~c1_pc && 2 <= ~wl_st) && 2 <= ~r_st) && ~t_b <= ~data) && 1 <= ~c2_pc) && ~data <= ~t_b) && 2 <= ~c2_st) && ~wb_pc == 0) && ~c_t <= ~c) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~wl_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~e_c == 0)) && ~t_b + 2 <= ~data) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_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) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~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) && ~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) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_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) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~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) && ~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) && ~c < ~c_t + 1) && !(~e_c == 0))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((!(~c1_st == 0) && (((((((~wl_pc == 1 && !(~e_c == 1)) && ~wb_pc == 1) && 1 <= ~c1_pc) && 2 <= ~r_st) && ~c < ~c_t + 1) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c) && 2 <= ~c2_st) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 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))) || ((((((!(~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) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 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: (((((((((((((1 <= ~c1_pc && ~wl_pc == 2) && 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) && !(~e_c == 0)) && ~t_b + 2 <= ~data) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~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)) && ~c < ~c_t + 1) && !(~e_c == 0)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((((((((((~wb_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~wl_st) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && 2 <= ~e_wl) && ~wl_pc == 2) && !(~c2_st == 0)) && ~data <= ~t_b + 1) && ~t_b + 1 <= ~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)) && ~c < ~c_t + 1) && !(~c2_st == 0)) && !(~e_c == 0)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((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) && ~wl_pc == 2) && ~c <= ~t_b + 2) && 2 <= ~r_st) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && ~c_t <= ~c) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~c < ~c_t + 1) && ~t_b + 2 <= ~data) && !(~e_c == 0))) || ~wl_pc == 0) || ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 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 && ~wl_pc == 2) && 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)) && ~t_b + 1 <= ~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) && ~c2_st == 0) && ~wl_pc == 1) && !(~e_c == 1)) && ~c < ~c_t + 1) && !(~e_c == 0))) || (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && 2 <= ~wl_st) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (2 <= ~c2_st && (((((((!(~e_c == 1) && ~wb_pc == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && ~c < ~c_t + 1) && 2 <= ~r_st) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~c_t <= ~c)) || ~wl_pc == 0) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && 2 <= ~wl_st) && ~wl_pc == 2) && 2 <= ~r_st) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && 2 <= ~c2_st) && !(~e_c == 1)) && ~wb_pc == 1) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 28.2s OverallTime, 20 OverallIterations, 9 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 14.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1205 SDtfs, 748 SDslu, 1352 SDs, 0 SdLazy, 263 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s 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, 20 MinimizatonAttempts, 565 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 129 NumberOfFragments, 4821 HoareAnnotationTreeSize, 29 FomulaSimplifications, 22106 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 29 FomulaSimplificationsInter, 11690 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1526 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1501 ConstructedInterpolants, 0 QuantifiedInterpolants, 267533 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2025 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 1645/1680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-48-13-430.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-48-13-430.csv Received shutdown request...