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.4.1.ufo.UNBOUNDED.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:26:48,389 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:26:48,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:26:48,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:26:48,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:26:48,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:26:48,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:26:48,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:26:48,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:26:48,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:26:48,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:26:48,410 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:26:48,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:26:48,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:26:48,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:26:48,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:26:48,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:26:48,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:26:48,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:26:48,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:26:48,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:26:48,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:26:48,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:26:48,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:26:48,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:26:48,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:26:48,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:26:48,446 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:26:48,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:26:48,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:26:48,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:26:48,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:26:48,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:26:48,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:26:48,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:26:48,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:26:48,453 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-10-04 12:26:48,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:26:48,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:26:48,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:26:48,470 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:26:48,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:26:48,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:26:48,471 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:26:48,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:26:48,472 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:26:48,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:26:48,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:26:48,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:26:48,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:26:48,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:26:48,473 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:26:48,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:26:48,473 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:26:48,473 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:26:48,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:26:48,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:26:48,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:26:48,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:26:48,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:26:48,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:26:48,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:26:48,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:26:48,475 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:26:48,475 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:26:48,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:26:48,476 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:26:48,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:26:48,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:26:48,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:26:48,559 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:26:48,560 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:26:48,561 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.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-10-04 12:26:48,561 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl' [2018-10-04 12:26:48,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:26:48,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:26:48,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:26:48,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:26:48,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:26:48,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:26:48,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:26:48,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:26:48,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:26:48,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... [2018-10-04 12:26:48,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:26:48,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:26:48,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:26:48,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:26:48,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:26:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:26:48,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:26:49,460 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:26:49,461 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:26:49 BoogieIcfgContainer [2018-10-04 12:26:49,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:26:49,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:26:49,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:26:49,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:26:49,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:26:48" (1/2) ... [2018-10-04 12:26:49,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c001d6 and model type pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:26:49, skipping insertion in model container [2018-10-04 12:26:49,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:26:49" (2/2) ... [2018-10-04 12:26:49,469 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl [2018-10-04 12:26:49,478 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:26:49,486 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:26:49,530 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:26:49,531 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:26:49,531 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:26:49,531 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:26:49,532 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:26:49,532 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:26:49,532 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:26:49,532 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:26:49,532 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:26:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-04 12:26:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:26:49,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:49,555 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:49,556 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:49,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-10-04 12:26:49,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:49,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:49,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:49,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:49,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:49,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:26:49,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:49,797 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-04 12:26:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:49,853 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-10-04 12:26:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:49,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:26:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:49,866 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:26:49,866 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:26:49,870 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-10-04 12:26:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:26:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-04 12:26:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:26:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-04 12:26:49,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-10-04 12:26:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:49,911 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-04 12:26:49,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-04 12:26:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:26:49,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:49,912 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:49,912 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:49,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-10-04 12:26:49,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:49,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:49,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:49,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:26:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:50,083 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-04 12:26:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:50,146 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-10-04 12:26:50,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:50,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:26:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:50,148 INFO L225 Difference]: With dead ends: 79 [2018-10-04 12:26:50,148 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:26:50,150 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-10-04 12:26:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:26:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-04 12:26:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:26:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-10-04 12:26:50,165 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-10-04 12:26:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:50,166 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-10-04 12:26:50,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-10-04 12:26:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:26:50,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:50,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:50,168 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:50,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-10-04 12:26:50,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:50,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:50,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:26:50,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:26:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:26:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:26:50,314 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-10-04 12:26:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:50,462 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-10-04 12:26:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:26:50,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-04 12:26:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:50,470 INFO L225 Difference]: With dead ends: 109 [2018-10-04 12:26:50,470 INFO L226 Difference]: Without dead ends: 107 [2018-10-04 12:26:50,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:26:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-04 12:26:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-10-04 12:26:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:26:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-10-04 12:26:50,516 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-10-04 12:26:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:50,517 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-10-04 12:26:50,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:26:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-10-04 12:26:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:26:50,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:50,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:50,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-10-04 12:26:50,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:50,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:50,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:50,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:50,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:26:50,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:50,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:50,630 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-10-04 12:26:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:50,720 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-10-04 12:26:50,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:50,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:26:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:50,725 INFO L225 Difference]: With dead ends: 143 [2018-10-04 12:26:50,725 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:26:50,731 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-10-04 12:26:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:26:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 12:26:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:26:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-04 12:26:50,754 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-10-04 12:26:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:50,754 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-04 12:26:50,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-04 12:26:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:26:50,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:50,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:50,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:50,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:50,757 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-10-04 12:26:50,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:50,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:50,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:50,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:50,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:26:50,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:50,885 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-04 12:26:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:50,956 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-10-04 12:26:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:50,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:26:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:50,959 INFO L225 Difference]: With dead ends: 249 [2018-10-04 12:26:50,959 INFO L226 Difference]: Without dead ends: 167 [2018-10-04 12:26:50,960 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-10-04 12:26:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-04 12:26:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-04 12:26:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 12:26:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-10-04 12:26:50,997 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-10-04 12:26:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:50,998 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-10-04 12:26:50,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-10-04 12:26:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:26:51,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:51,000 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:51,000 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:51,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-10-04 12:26:51,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:51,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:51,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:51,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:51,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:26:51,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:51,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:51,099 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-10-04 12:26:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:51,212 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-10-04 12:26:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:51,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-04 12:26:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:51,217 INFO L225 Difference]: With dead ends: 489 [2018-10-04 12:26:51,217 INFO L226 Difference]: Without dead ends: 327 [2018-10-04 12:26:51,220 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-10-04 12:26:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-04 12:26:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-04 12:26:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-04 12:26:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-10-04 12:26:51,305 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-10-04 12:26:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:51,305 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-10-04 12:26:51,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-10-04 12:26:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:26:51,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:51,308 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:26:51,308 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:51,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:51,309 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-10-04 12:26:51,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:51,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:51,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:26:51,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:26:51,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:26:51,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:51,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:26:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:26:51,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:26:51,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-04 12:26:51,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:26:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:26:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:26:51,783 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-10-04 12:26:52,263 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:26:52,931 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:26:53,168 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-04 12:26:53,930 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-04 12:26:54,121 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-04 12:26:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:54,408 INFO L93 Difference]: Finished difference Result 737 states and 923 transitions. [2018-10-04 12:26:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:26:54,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-04 12:26:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:54,410 INFO L225 Difference]: With dead ends: 737 [2018-10-04 12:26:54,410 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 12:26:54,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:26:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 12:26:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2018-10-04 12:26:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-04 12:26:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2018-10-04 12:26:54,461 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 26 [2018-10-04 12:26:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:54,461 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2018-10-04 12:26:54,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:26:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2018-10-04 12:26:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 12:26:54,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:26:54,464 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:26:54,464 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:26:54,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:26:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 2 times [2018-10-04 12:26:54,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:26:54,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:26:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:54,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:26:54,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:26:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:26:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 12:26:54,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:26:54,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:26:54,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:26:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:26:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:26:54,547 INFO L87 Difference]: Start difference. First operand 247 states and 286 transitions. Second operand 3 states. [2018-10-04 12:26:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:26:54,560 INFO L93 Difference]: Finished difference Result 247 states and 286 transitions. [2018-10-04 12:26:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:26:54,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-04 12:26:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:26:54,561 INFO L225 Difference]: With dead ends: 247 [2018-10-04 12:26:54,561 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:26:54,562 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-10-04 12:26:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:26:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:26:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:26:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:26:54,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-10-04 12:26:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:26:54,563 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:26:54,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:26:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:26:54,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:26:54,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:26:54,927 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:26:55,489 WARN L178 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 12:26:55,990 WARN L178 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-04 12:26:56,216 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 12:26:56,712 WARN L178 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 12:26:56,873 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-04 12:26:57,087 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-04 12:26:57,261 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 387) no Hoare annotation was computed. [2018-10-04 12:26:57,262 INFO L421 ceAbstractionStarter]: At program point L320(lines 314 321) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 12:26:57,262 INFO L421 ceAbstractionStarter]: At program point L384(lines 253 384) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-04 12:26:57,262 INFO L421 ceAbstractionStarter]: At program point L285(lines 285 295) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-10-04 12:26:57,262 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 386) no Hoare annotation was computed. [2018-10-04 12:26:57,263 INFO L421 ceAbstractionStarter]: At program point L300(lines 294 301) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-04 12:26:57,263 INFO L421 ceAbstractionStarter]: At program point L325(lines 325 335) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 12:26:57,263 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 361) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse5))) [2018-10-04 12:26:57,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 387) no Hoare annotation was computed. [2018-10-04 12:26:57,263 INFO L421 ceAbstractionStarter]: At program point L381(lines 381 385) the Hoare annotation is: false [2018-10-04 12:26:57,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 387) no Hoare annotation was computed. [2018-10-04 12:26:57,264 INFO L421 ceAbstractionStarter]: At program point L280(lines 271 281) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-10-04 12:26:57,264 INFO L421 ceAbstractionStarter]: At program point L375(lines 375 382) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~103) (= 0 (+ ~nomsg 1))) [2018-10-04 12:26:57,264 INFO L421 ceAbstractionStarter]: At program point L340(lines 334 341) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-04 12:26:57,264 INFO L421 ceAbstractionStarter]: At program point L305(lines 305 315) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-04 12:26:57,264 INFO L421 ceAbstractionStarter]: At program point L365(lines 360 366) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~103) (= 0 (+ ~nomsg 1))) [2018-10-04 12:26:57,265 INFO L421 ceAbstractionStarter]: At program point L260(lines 260 272) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-04 12:26:57,277 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,278 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,281 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,285 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,285 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,288 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,289 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,295 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,295 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,297 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,301 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,303 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,303 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,306 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,306 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,308 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,308 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,311 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,312 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,315 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,315 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,317 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,317 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,319 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,319 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,322 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:26:57 BoogieIcfgContainer [2018-10-04 12:26:57,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:26:57,324 INFO L168 Benchmark]: Toolchain (without parser) took 8671.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 993.0 MB in the end (delta: 470.5 MB). Peak memory consumption was 470.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:57,325 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:57,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:57,326 INFO L168 Benchmark]: Boogie Preprocessor took 43.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:26:57,327 INFO L168 Benchmark]: RCFGBuilder took 713.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:57,330 INFO L168 Benchmark]: TraceAbstraction took 7860.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 993.0 MB in the end (delta: 438.8 MB). Peak memory consumption was 438.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:26:57,337 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 713.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7860.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 993.0 MB in the end (delta: 438.8 MB). Peak memory consumption was 438.8 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: 386]: 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: 360]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~103) && 0 == ~nomsg + 1 - InvariantResult [Line: 354]: Loop Invariant [2018-10-04 12:26:57,354 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,355 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~103) && 0 == ~nomsg + 1 - InvariantResult [Line: 285]: Loop Invariant [2018-10-04 12:26:57,359 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,365 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 314]: Loop Invariant [2018-10-04 12:26:57,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,370 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,371 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,371 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 334]: Loop Invariant [2018-10-04 12:26:57,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 294]: Loop Invariant [2018-10-04 12:26:57,376 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,377 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,383 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 305]: Loop Invariant [2018-10-04 12:26:57,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,384 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,385 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 271]: Loop Invariant [2018-10-04 12:26:57,390 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,390 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,391 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,392 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 325]: Loop Invariant [2018-10-04 12:26:57,393 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,394 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-04 12:26:57,395 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((0 <= ~send1 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 7.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 182 SDslu, 170 SDs, 0 SdLazy, 162 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=6, 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 167 NumberOfFragments, 984 HoareAnnotationTreeSize, 13 FomulaSimplifications, 6601 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 201 ConstructedInterpolants, 8 QuantifiedInterpolants, 17409 SizeOfPredicates, 1 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 108/120 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.4.1.ufo.UNBOUNDED.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-26-57-404.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c_10.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-26-57-404.csv Received shutdown request...