java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:39:53,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:39:53,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:39:53,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:39:53,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:39:53,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:39:53,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:39:53,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:39:53,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:39:53,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:39:53,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:39:53,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:39:53,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:39:53,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:39:53,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:39:53,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:39:53,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:39:53,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:39:53,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:39:53,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:39:53,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:39:53,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:39:53,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:39:53,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:39:53,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:39:53,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:39:53,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:39:53,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:39:53,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:39:53,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:39:53,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:39:53,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:39:53,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:39:53,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:39:53,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:39:53,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:39:53,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:39:53,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:39:53,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:39:53,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:39:53,095 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:39:53,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:39:53,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:39:53,096 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:39:53,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:39:53,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:39:53,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:39:53,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:39:53,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:39:53,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:39:53,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:39:53,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:39:53,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:39:53,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:39:53,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:39:53,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:39:53,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:39:53,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:39:53,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:39:53,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:39:53,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:39:53,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:39:53,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:39:53,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:39:53,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:39:53,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:39:53,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:39:53,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:39:53,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:39:53,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:39:53,174 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:39:53,175 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:39:53,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 23:39:53,176 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-30 23:39:53,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:39:53,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:39:53,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:39:53,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:39:53,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:39:53,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:39:53,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:39:53,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:39:53,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:39:53,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... [2018-09-30 23:39:53,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:39:53,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:39:53,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:39:53,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:39:53,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:39:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 23:39:53,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 23:39:54,154 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 23:39:54,154 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:39:54 BoogieIcfgContainer [2018-09-30 23:39:54,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:39:54,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:39:54,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:39:54,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:39:54,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:39:53" (1/2) ... [2018-09-30 23:39:54,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40493a4c and model type pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:39:54, skipping insertion in model container [2018-09-30 23:39:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:39:54" (2/2) ... [2018-09-30 23:39:54,162 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-30 23:39:54,172 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:39:54,180 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:39:54,229 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:39:54,230 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:39:54,230 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:39:54,230 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:39:54,231 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:39:54,231 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:39:54,231 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:39:54,231 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:39:54,231 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:39:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-30 23:39:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 23:39:54,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:54,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:54,254 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:54,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-30 23:39:54,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:54,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:54,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:54,545 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:54,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:54,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:54,566 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-30 23:39:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:54,635 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-30 23:39:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:54,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 23:39:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:54,648 INFO L225 Difference]: With dead ends: 57 [2018-09-30 23:39:54,648 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 23:39:54,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 23:39:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-30 23:39:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 23:39:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 23:39:54,694 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-30 23:39:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:54,695 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 23:39:54,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 23:39:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 23:39:54,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:54,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:54,697 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:54,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-30 23:39:54,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:54,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:54,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:54,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:54,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:54,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:54,885 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 23:39:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:54,969 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-30 23:39:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:54,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 23:39:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:54,971 INFO L225 Difference]: With dead ends: 103 [2018-09-30 23:39:54,971 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 23:39:54,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 23:39:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-30 23:39:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 23:39:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-30 23:39:54,992 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-30 23:39:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:54,993 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-30 23:39:54,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-30 23:39:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 23:39:54,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:54,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:54,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:54,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:54,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-30 23:39:54,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:54,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:54,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:54,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:54,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:55,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:55,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:39:55,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:39:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:39:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:39:55,222 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-30 23:39:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:55,505 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-30 23:39:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:39:55,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-30 23:39:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:55,510 INFO L225 Difference]: With dead ends: 141 [2018-09-30 23:39:55,510 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 23:39:55,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:39:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 23:39:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-30 23:39:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 23:39:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-30 23:39:55,537 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-30 23:39:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:55,538 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-30 23:39:55,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:39:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-30 23:39:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 23:39:55,541 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:55,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:55,542 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:55,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-30 23:39:55,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:55,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:55,688 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:55,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:39:55,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:55,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:55,690 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-30 23:39:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:55,772 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-30 23:39:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:55,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-30 23:39:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:55,774 INFO L225 Difference]: With dead ends: 183 [2018-09-30 23:39:55,774 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 23:39:55,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 23:39:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 23:39:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 23:39:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-30 23:39:55,818 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-30 23:39:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:55,818 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-30 23:39:55,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-30 23:39:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 23:39:55,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:55,821 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:55,821 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:55,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:55,822 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-30 23:39:55,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:55,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:55,961 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:55,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:39:55,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:55,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:55,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:55,963 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-30 23:39:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:56,061 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-30 23:39:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:56,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 23:39:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:56,065 INFO L225 Difference]: With dead ends: 321 [2018-09-30 23:39:56,065 INFO L226 Difference]: Without dead ends: 215 [2018-09-30 23:39:56,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-30 23:39:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-30 23:39:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 23:39:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-30 23:39:56,146 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-30 23:39:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:56,146 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-30 23:39:56,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-30 23:39:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 23:39:56,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:56,151 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:56,151 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:56,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-30 23:39:56,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:56,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:56,264 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:56,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:39:56,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:56,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:56,265 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-30 23:39:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:56,382 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-30 23:39:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:56,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 23:39:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:56,389 INFO L225 Difference]: With dead ends: 633 [2018-09-30 23:39:56,389 INFO L226 Difference]: Without dead ends: 423 [2018-09-30 23:39:56,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-30 23:39:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-30 23:39:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-30 23:39:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-30 23:39:56,482 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-30 23:39:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:56,484 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-30 23:39:56,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-30 23:39:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 23:39:56,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:56,488 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:56,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:56,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-30 23:39:56,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:56,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:56,626 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:56,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:39:56,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:56,628 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-30 23:39:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:56,803 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-30 23:39:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:56,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 23:39:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:56,808 INFO L225 Difference]: With dead ends: 1257 [2018-09-30 23:39:56,809 INFO L226 Difference]: Without dead ends: 839 [2018-09-30 23:39:56,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-30 23:39:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-30 23:39:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-30 23:39:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-30 23:39:56,938 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-30 23:39:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:56,938 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-30 23:39:56,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-30 23:39:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 23:39:56,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:56,942 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-09-30 23:39:56,942 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:56,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:56,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-30 23:39:56,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:56,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:56,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:56,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:56,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:57,063 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:39:57,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:39:57,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:39:57,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:39:57,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:57,065 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-30 23:39:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:39:57,340 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-30 23:39:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:39:57,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 23:39:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:39:57,350 INFO L225 Difference]: With dead ends: 2505 [2018-09-30 23:39:57,351 INFO L226 Difference]: Without dead ends: 1671 [2018-09-30 23:39:57,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:39:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-30 23:39:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-30 23:39:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-30 23:39:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-30 23:39:57,579 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-30 23:39:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:39:57,579 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-30 23:39:57,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:39:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-30 23:39:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 23:39:57,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:39:57,583 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:39:57,583 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:39:57,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:39:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-30 23:39:57,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:39:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:39:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:57,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:57,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:39:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:39:57,804 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:39:57,804 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:39:57,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:39:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:39:57,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:39:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 23:39:58,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:39:58,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-30 23:39:58,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:39:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:39:58,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:39:58,280 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-30 23:39:58,507 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 23:39:58,902 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:39:59,352 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:39:59,667 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 23:40:00,251 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-30 23:40:01,884 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 23:40:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:02,108 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-30 23:40:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:40:02,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-30 23:40:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:02,124 INFO L225 Difference]: With dead ends: 4801 [2018-09-30 23:40:02,125 INFO L226 Difference]: Without dead ends: 3135 [2018-09-30 23:40:02,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:40:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-30 23:40:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-30 23:40:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-30 23:40:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-30 23:40:02,515 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-30 23:40:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:02,516 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-30 23:40:02,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:40:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-30 23:40:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 23:40:02,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:02,520 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 23:40:02,520 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:02,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-30 23:40:02,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:02,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:02,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:40:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 23:40:02,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:40:02,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:40:02,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:40:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:40:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:40:02,700 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-30 23:40:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:03,232 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-30 23:40:03,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:40:03,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 23:40:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:03,243 INFO L225 Difference]: With dead ends: 4873 [2018-09-30 23:40:03,244 INFO L226 Difference]: Without dead ends: 2215 [2018-09-30 23:40:03,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:40:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-30 23:40:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-30 23:40:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-30 23:40:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-30 23:40:03,547 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-30 23:40:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:03,547 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-30 23:40:03,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:40:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-30 23:40:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 23:40:03,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:40:03,550 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 23:40:03,551 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:40:03,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:40:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-30 23:40:03,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:40:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:40:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:03,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:40:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:40:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:40:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-30 23:40:03,635 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:40:03,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:40:03,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:40:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:40:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:40:03,637 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-30 23:40:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:40:03,670 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-30 23:40:03,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:40:03,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-30 23:40:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:40:03,671 INFO L225 Difference]: With dead ends: 1799 [2018-09-30 23:40:03,671 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:40:03,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:40:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:40:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:40:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:40:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:40:03,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-30 23:40:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:40:03,675 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:40:03,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:40:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:40:03,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:40:03,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:40:03,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,804 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-30 23:40:03,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:03,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,081 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 23:40:04,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,327 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 40 [2018-09-30 23:40:04,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,752 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 45 [2018-09-30 23:40:04,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:04,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:40:05,887 WARN L178 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-30 23:40:06,158 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:06,432 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:06,616 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:06,929 WARN L178 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 23:40:07,066 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:07,342 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:07,464 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:07,590 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:07,752 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-30 23:40:07,856 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-09-30 23:40:08,002 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-30 23:40:08,006 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 23:40:08,006 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:40:08,007 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-30 23:40:08,007 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,007 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-30 23:40:08,007 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-30 23:40:08,007 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-30 23:40:08,008 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-30 23:40:08,008 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:40:08,008 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,008 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 23:40:08,008 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:40:08,009 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-30 23:40:08,009 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,009 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-30 23:40:08,009 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,010 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-30 23:40:08,010 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,010 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~159) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-30 23:40:08,010 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,011 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-30 23:40:08,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,047 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,049 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,049 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,051 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,051 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,055 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,055 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,067 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:40:08 BoogieIcfgContainer [2018-09-30 23:40:08,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:40:08,068 INFO L168 Benchmark]: Toolchain (without parser) took 14803.19 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.7 MB). Free memory was 1.5 GB in the beginning and 982.9 MB in the end (delta: 495.8 MB). Peak memory consumption was 672.5 MB. Max. memory is 7.1 GB. [2018-09-30 23:40:08,070 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:40:08,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:40:08,071 INFO L168 Benchmark]: Boogie Preprocessor took 61.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:40:08,071 INFO L168 Benchmark]: RCFGBuilder took 766.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 23:40:08,072 INFO L168 Benchmark]: TraceAbstraction took 13912.11 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.7 MB). Free memory was 1.4 GB in the beginning and 982.9 MB in the end (delta: 453.5 MB). Peak memory consumption was 630.2 MB. Max. memory is 7.1 GB. [2018-09-30 23:40:08,076 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.18 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 57.92 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 61.15 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 766.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13912.11 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 176.7 MB). Free memory was 1.4 GB in the beginning and 982.9 MB in the end (delta: 453.5 MB). Peak memory consumption was 630.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: 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: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-09-30 23:40:08,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-30 23:40:08,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-30 23:40:08,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-30 23:40:08,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-30 23:40:08,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-30 23:40:08,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-30 23:40:08,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~159) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-30 23:40:08,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-30 23:40:08,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,112 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-30 23:40:08,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-30 23:40:08,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, 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: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 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/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-40-08-121.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-40-08-121.csv Received shutdown request...