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.5.2.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:25:20,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:25:20,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:25:20,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:25:20,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:25:20,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:25:20,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:25:20,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:25:20,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:25:20,332 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:25:20,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:25:20,333 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:25:20,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:25:20,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:25:20,336 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:25:20,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:25:20,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:25:20,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:25:20,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:25:20,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:25:20,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:25:20,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:25:20,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:25:20,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:25:20,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:25:20,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:25:20,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:25:20,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:25:20,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:25:20,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:25:20,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:25:20,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:25:20,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:25:20,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:25:20,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:25:20,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:25:20,367 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-26 21:25:20,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:25:20,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:25:20,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:25:20,390 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:25:20,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:25:20,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:25:20,391 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:25:20,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:25:20,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:25:20,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:25:20,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:25:20,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:25:20,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:25:20,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:25:20,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:25:20,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:25:20,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:25:20,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:25:20,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:25:20,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:25:20,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:25:20,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:25:20,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:20,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:25:20,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:25:20,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:25:20,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:25:20,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:25:20,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:25:20,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:25:20,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:25:20,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:25:20,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:25:20,480 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:25:20,481 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:25:20,482 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-26 21:25:20,482 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-26 21:25:20,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:25:20,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:25:20,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:20,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:25:20,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:25:20,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:25:20,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:25:20,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:25:20,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:25:20,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... [2018-09-26 21:25:20,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:25:20,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:25:20,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:25:20,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:25:20,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:25:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:25:20,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:25:21,394 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:25:21,394 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:21 BoogieIcfgContainer [2018-09-26 21:25:21,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:25:21,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:25:21,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:25:21,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:25:21,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:25:20" (1/2) ... [2018-09-26 21:25:21,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64abc25c and model type pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:25:21, skipping insertion in model container [2018-09-26 21:25:21,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:25:21" (2/2) ... [2018-09-26 21:25:21,402 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-26 21:25:21,412 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:25:21,421 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:25:21,467 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:25:21,467 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:25:21,468 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:25:21,468 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:25:21,468 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:25:21,468 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:25:21,468 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:25:21,469 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:25:21,469 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:25:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-09-26 21:25:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:21,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:21,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:21,494 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:21,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-09-26 21:25:21,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:21,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:21,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:21,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:21,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:21,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:21,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:21,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:21,784 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-09-26 21:25:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:21,865 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-09-26 21:25:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:21,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:21,883 INFO L225 Difference]: With dead ends: 51 [2018-09-26 21:25:21,884 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 21:25:21,888 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-26 21:25:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 21:25:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-09-26 21:25:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:25:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-26 21:25:21,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-09-26 21:25:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:21,948 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-26 21:25:21,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-26 21:25:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:21,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:21,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:21,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:21,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-09-26 21:25:21,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:22,119 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:22,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:22,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:22,123 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-26 21:25:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:22,182 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-09-26 21:25:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:22,192 INFO L225 Difference]: With dead ends: 91 [2018-09-26 21:25:22,192 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 21:25:22,193 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-26 21:25:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 21:25:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-09-26 21:25:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 21:25:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-09-26 21:25:22,229 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-09-26 21:25:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:22,230 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-09-26 21:25:22,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-09-26 21:25:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:22,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:22,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:22,231 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:22,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:22,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-09-26 21:25:22,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:22,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:22,363 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:22,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:22,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:22,366 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-09-26 21:25:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:22,415 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-09-26 21:25:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:22,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:22,420 INFO L225 Difference]: With dead ends: 175 [2018-09-26 21:25:22,420 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 21:25:22,421 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-26 21:25:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 21:25:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-09-26 21:25:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 21:25:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-09-26 21:25:22,462 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-09-26 21:25:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:22,462 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-09-26 21:25:22,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-09-26 21:25:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:22,464 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:22,464 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:22,464 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:22,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416297, now seen corresponding path program 1 times [2018-09-26 21:25:22,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:22,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:22,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:22,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:22,567 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:22,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:22,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:22,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:22,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:22,569 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-09-26 21:25:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:22,635 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-09-26 21:25:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:22,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:22,638 INFO L225 Difference]: With dead ends: 343 [2018-09-26 21:25:22,639 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 21:25:22,640 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-26 21:25:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 21:25:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-09-26 21:25:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 21:25:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-09-26 21:25:22,696 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-09-26 21:25:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:22,696 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-09-26 21:25:22,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-09-26 21:25:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:22,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:22,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:22,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:22,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:22,701 INFO L82 PathProgramCache]: Analyzing trace with hash -955157995, now seen corresponding path program 1 times [2018-09-26 21:25:22,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:22,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:22,833 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:22,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:22,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:22,834 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-09-26 21:25:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:22,914 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-09-26 21:25:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:22,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-09-26 21:25:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:22,921 INFO L225 Difference]: With dead ends: 569 [2018-09-26 21:25:22,921 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 21:25:22,926 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-26 21:25:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 21:25:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-09-26 21:25:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 21:25:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-09-26 21:25:23,008 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-09-26 21:25:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:23,008 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-09-26 21:25:23,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-09-26 21:25:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:25:23,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:23,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:25:23,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:23,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash -955217577, now seen corresponding path program 1 times [2018-09-26 21:25:23,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:23,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:23,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:23,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:23,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:23,241 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:23,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:25:23,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:25:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:25:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:25:23,243 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-09-26 21:25:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:23,546 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-09-26 21:25:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:25:23,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-26 21:25:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:23,551 INFO L225 Difference]: With dead ends: 610 [2018-09-26 21:25:23,551 INFO L226 Difference]: Without dead ends: 608 [2018-09-26 21:25:23,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:25:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-26 21:25:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-09-26 21:25:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-26 21:25:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-09-26 21:25:23,632 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-09-26 21:25:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:23,633 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-09-26 21:25:23,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:25:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-09-26 21:25:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:25:23,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:23,638 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] [2018-09-26 21:25:23,638 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:23,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash 509433139, now seen corresponding path program 1 times [2018-09-26 21:25:23,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:23,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:23,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:23,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:23,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:23,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:23,818 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-09-26 21:25:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:24,016 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-09-26 21:25:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:24,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:25:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:24,023 INFO L225 Difference]: With dead ends: 1113 [2018-09-26 21:25:24,024 INFO L226 Difference]: Without dead ends: 743 [2018-09-26 21:25:24,025 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-26 21:25:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-26 21:25:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-09-26 21:25:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-26 21:25:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-09-26 21:25:24,152 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-09-26 21:25:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:24,152 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-09-26 21:25:24,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-09-26 21:25:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:25:24,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:24,161 INFO L375 BasicCegarLoop]: trace histogram [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-26 21:25:24,161 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:24,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash 251267701, now seen corresponding path program 1 times [2018-09-26 21:25:24,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:24,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:24,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:24,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:25:24,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:25:24,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:25:24,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:24,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:25:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:25:24,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:25:24,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-26 21:25:24,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:25:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:25:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:25:24,841 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-09-26 21:25:25,240 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:25,648 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:25:26,058 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-26 21:25:27,400 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-26 21:25:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:27,732 INFO L93 Difference]: Finished difference Result 2109 states and 2642 transitions. [2018-09-26 21:25:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:25:27,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-09-26 21:25:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:27,740 INFO L225 Difference]: With dead ends: 2109 [2018-09-26 21:25:27,740 INFO L226 Difference]: Without dead ends: 1371 [2018-09-26 21:25:27,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-26 21:25:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-26 21:25:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 933. [2018-09-26 21:25:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-26 21:25:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1156 transitions. [2018-09-26 21:25:27,992 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1156 transitions. Word has length 30 [2018-09-26 21:25:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:27,992 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1156 transitions. [2018-09-26 21:25:27,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:25:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1156 transitions. [2018-09-26 21:25:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 21:25:27,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:27,996 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 21:25:27,997 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:27,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1989135149, now seen corresponding path program 2 times [2018-09-26 21:25:27,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:27,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:28,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:28,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:25:28,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-26 21:25:28,120 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:28,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:25:28,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:28,122 INFO L87 Difference]: Start difference. First operand 933 states and 1156 transitions. Second operand 3 states. [2018-09-26 21:25:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:28,399 INFO L93 Difference]: Finished difference Result 2161 states and 2654 transitions. [2018-09-26 21:25:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:28,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-26 21:25:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:28,404 INFO L225 Difference]: With dead ends: 2161 [2018-09-26 21:25:28,405 INFO L226 Difference]: Without dead ends: 975 [2018-09-26 21:25:28,407 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-26 21:25:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-26 21:25:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 797. [2018-09-26 21:25:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-26 21:25:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 959 transitions. [2018-09-26 21:25:28,593 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 959 transitions. Word has length 58 [2018-09-26 21:25:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:28,593 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 959 transitions. [2018-09-26 21:25:28,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 959 transitions. [2018-09-26 21:25:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 21:25:28,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:25:28,596 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 21:25:28,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:25:28,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:25:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1225807471, now seen corresponding path program 3 times [2018-09-26 21:25:28,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:25:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:25:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:28,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:25:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:25:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:25:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-26 21:25:28,681 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:25:28,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:25:28,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:25:28,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:25:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:25:28,684 INFO L87 Difference]: Start difference. First operand 797 states and 959 transitions. Second operand 3 states. [2018-09-26 21:25:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:25:28,707 INFO L93 Difference]: Finished difference Result 799 states and 961 transitions. [2018-09-26 21:25:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:25:28,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-09-26 21:25:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:25:28,708 INFO L225 Difference]: With dead ends: 799 [2018-09-26 21:25:28,708 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:25:28,709 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-26 21:25:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:25:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:25:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:25:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:25:28,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-09-26 21:25:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:25:28,711 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:25:28,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:25:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:25:28,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:25:28,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:25:28,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:28,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:29,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:25:31,353 WARN L178 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-26 21:25:31,522 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-26 21:25:31,722 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:32,238 WARN L178 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-26 21:25:32,568 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-26 21:25:32,836 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-26 21:25:32,946 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-26 21:25:33,145 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-09-26 21:25:33,294 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-26 21:25:33,590 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-09-26 21:25:33,832 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-26 21:25:33,955 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-09-26 21:25:34,117 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-09-26 21:25:34,121 INFO L422 ceAbstractionStarter]: At program point L353(lines 344 354) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (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 .cse7))) [2018-09-26 21:25:34,122 INFO L422 ceAbstractionStarter]: At program point L378(lines 378 387) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-26 21:25:34,122 INFO L422 ceAbstractionStarter]: At program point L440(lines 435 441) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-26 21:25:34,122 INFO L422 ceAbstractionStarter]: At program point L358(lines 358 368) the Hoare annotation is: (let ((.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256)))) (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_check_~tmp~128) .cse5 (<= 1 ULTIMATE.start_assert_~arg) .cse6 .cse7) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)) (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 .cse7))) [2018-09-26 21:25:34,122 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 462) no Hoare annotation was computed. [2018-09-26 21:25:34,122 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 462) no Hoare annotation was computed. [2018-09-26 21:25:34,122 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 461) no Hoare annotation was computed. [2018-09-26 21:25:34,122 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 436) 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-26 21:25:34,123 INFO L422 ceAbstractionStarter]: At program point L330(lines 325 331) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-26 21:25:34,123 INFO L422 ceAbstractionStarter]: At program point L450(lines 450 457) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (<= 1 ULTIMATE.start_check_~tmp~128) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg)) [2018-09-26 21:25:34,123 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 462) no Hoare annotation was computed. [2018-09-26 21:25:34,123 INFO L422 ceAbstractionStarter]: At program point L413(lines 407 414) 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-26 21:25:34,123 INFO L422 ceAbstractionStarter]: At program point L314(lines 314 326) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-26 21:25:34,123 INFO L422 ceAbstractionStarter]: At program point L335(lines 335 345) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2) (and (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (= ~mode2 (* 256 (div ~mode2 256)))))) [2018-09-26 21:25:34,123 INFO L422 ceAbstractionStarter]: At program point L459(lines 307 459) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 (div ~mode4 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-26 21:25:34,124 INFO L422 ceAbstractionStarter]: At program point L393(lines 386 394) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-26 21:25:34,124 INFO L422 ceAbstractionStarter]: At program point L373(lines 367 374) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6 (= ~mode4 (* 256 (div ~mode4 256)))) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-26 21:25:34,124 INFO L422 ceAbstractionStarter]: At program point L398(lines 398 408) the Hoare annotation is: (let ((.cse7 (<= 1 ~mode2)) (.cse0 (<= ~mode2 1)) (.cse1 (<= ~send2 127)) (.cse2 (<= 0 ~send2)) (.cse3 (<= ~mode3 1)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (not (= ~p2_new ~nomsg)))) (or (and (<= ULTIMATE.start_assert_~arg 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (mod ~r1 256) 0) .cse7 (<= 1 ULTIMATE.start_check_~tmp~128) (<= 1 ULTIMATE.start_assert_~arg)) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse7 .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-09-26 21:25:34,124 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 460) the Hoare annotation is: false [2018-09-26 21:25:34,133 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,134 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,150 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,156 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,178 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,179 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,181 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,185 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,190 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:25:34 BoogieIcfgContainer [2018-09-26 21:25:34,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:25:34,191 INFO L168 Benchmark]: Toolchain (without parser) took 13616.41 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 167.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -178.7 MB). Peak memory consumption was 619.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:34,196 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:34,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:34,197 INFO L168 Benchmark]: Boogie Preprocessor took 64.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:25:34,198 INFO L168 Benchmark]: RCFGBuilder took 705.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:34,199 INFO L168 Benchmark]: TraceAbstraction took 12794.85 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 167.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -210.4 MB). Peak memory consumption was 587.5 MB. Max. memory is 7.1 GB. [2018-09-26 21:25:34,206 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 705.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12794.85 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 167.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -210.4 MB). Peak memory consumption was 587.5 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: 398]: Loop Invariant [2018-09-26 21:25:34,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,219 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,220 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~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) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= check_~tmp~128) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 429]: Loop Invariant [2018-09-26 21:25:34,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,221 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,221 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: 450]: Loop Invariant Derived loop invariant: (((((((((assert_~arg <= 1 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg - InvariantResult [Line: 344]: Loop Invariant [2018-09-26 21:25:34,222 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,223 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~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)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 367]: Loop Invariant [2018-09-26 21:25:34,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,225 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,226 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 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) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - InvariantResult [Line: 386]: Loop Invariant [2018-09-26 21:25:34,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,227 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,228 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || (((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~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) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 407]: Loop Invariant [2018-09-26 21:25:34,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,229 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,230 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: 358]: Loop Invariant [2018-09-26 21:25:34,230 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,231 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,234 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((((assert_~arg <= 1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 1 <= check_~tmp~128) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1)) || (((((((~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)) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 378]: Loop Invariant [2018-09-26 21:25:34,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,237 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-26 21:25:34,241 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((((assert_~arg <= 1 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) && ~r1 % 256 <= 0) && 1 <= ~mode2) && 1 <= check_~tmp~128) && 1 <= assert_~arg) || ((((((((((~mode5 == 256 * (~mode5 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) && ~mode4 == 256 * (~mode4 / 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) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) || (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && ~mode2 == 256 * (~mode2 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 12.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 5.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 277 SDslu, 248 SDs, 0 SdLazy, 185 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=933occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 863 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 275 NumberOfFragments, 1391 HoareAnnotationTreeSize, 15 FomulaSimplifications, 34986 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 15 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 10 QuantifiedInterpolants, 30797 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 194/210 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.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-25-34-253.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-25-34-253.csv Received shutdown request...