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.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:27:40,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:27:40,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:27:40,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:27:40,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:27:40,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:27:40,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:27:40,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:27:40,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:27:40,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:27:40,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:27:40,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:27:40,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:27:40,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:27:40,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:27:40,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:27:40,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:27:40,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:27:40,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:27:40,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:27:40,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:27:40,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:27:40,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:27:40,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:27:40,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:27:40,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:27:40,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:27:40,576 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:27:40,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:27:40,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:27:40,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:27:40,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:27:40,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:27:40,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:27:40,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:27:40,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:27:40,581 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:27:40,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:27:40,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:27:40,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:27:40,606 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:27:40,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:27:40,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:27:40,606 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:27:40,611 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:27:40,611 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:27:40,611 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:27:40,611 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:27:40,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:27:40,612 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:27:40,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:27:40,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:27:40,612 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:27:40,612 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:27:40,612 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:27:40,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:27:40,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:27:40,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:27:40,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:27:40,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:27:40,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:27:40,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:27:40,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:27:40,614 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:27:40,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:27:40,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:27:40,615 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:27:40,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:27:40,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:27:40,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:27:40,692 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:27:40,692 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:27:40,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-04 12:27:40,693 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-10-04 12:27:40,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:27:40,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:27:40,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:40,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:27:40,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:27:40,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:27:40,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:27:40,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:27:40,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:27:40,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/1) ... [2018-10-04 12:27:40,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:27:40,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:27:40,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:27:40,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:27:40,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (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:27:40,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:27:40,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:27:41,582 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:27:41,583 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:41 BoogieIcfgContainer [2018-10-04 12:27:41,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:27:41,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:27:41,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:27:41,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:27:41,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:27:40" (1/2) ... [2018-10-04 12:27:41,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc2f153 and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:27:41, skipping insertion in model container [2018-10-04 12:27:41,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:27:41" (2/2) ... [2018-10-04 12:27:41,590 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-10-04 12:27:41,600 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:27:41,608 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:27:41,658 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:27:41,658 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:27:41,659 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:27:41,659 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:27:41,659 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:27:41,659 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:27:41,659 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:27:41,659 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:27:41,660 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:27:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-04 12:27:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:27:41,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:41,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:41,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:41,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-10-04 12:27:41,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:41,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:41,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:41,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:41,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:41,938 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:27:41,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:41,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:41,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:41,960 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-04 12:27:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:42,029 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-04 12:27:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:42,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:27:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:42,042 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:27:42,042 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:27:42,046 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:27:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:27:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-04 12:27:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:27:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-10-04 12:27:42,087 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-10-04 12:27:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:42,088 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-10-04 12:27:42,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-10-04 12:27:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:27:42,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:42,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:42,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:42,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-10-04 12:27:42,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:42,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:42,214 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:27:42,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:42,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:42,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:42,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:42,217 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-10-04 12:27:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:42,272 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-10-04 12:27:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:42,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:27:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:42,274 INFO L225 Difference]: With dead ends: 97 [2018-10-04 12:27:42,275 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:27:42,276 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:27:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:27:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-04 12:27:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:27:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-10-04 12:27:42,297 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-10-04 12:27:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:42,297 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-10-04 12:27:42,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-10-04 12:27:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:27:42,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:42,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:42,299 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:42,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-10-04 12:27:42,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:42,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:42,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:42,474 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:27:42,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:42,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:42,477 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-10-04 12:27:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:42,549 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-10-04 12:27:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:42,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:27:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:42,561 INFO L225 Difference]: With dead ends: 187 [2018-10-04 12:27:42,562 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 12:27:42,565 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:27:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 12:27:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-04 12:27:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-04 12:27:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-10-04 12:27:42,612 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-10-04 12:27:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:42,613 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-10-04 12:27:42,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-10-04 12:27:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:27:42,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:42,614 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:42,614 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:42,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-10-04 12:27:42,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:42,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:42,744 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:27:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:27:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:42,746 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-10-04 12:27:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:42,828 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-10-04 12:27:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:42,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 12:27:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:42,832 INFO L225 Difference]: With dead ends: 367 [2018-10-04 12:27:42,832 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 12:27:42,833 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:27:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 12:27:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-04 12:27:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 12:27:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-10-04 12:27:42,901 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-10-04 12:27:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:42,901 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-10-04 12:27:42,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-10-04 12:27:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:27:42,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:42,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:42,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:42,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-10-04 12:27:42,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:42,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:42,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:43,130 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:27:43,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:27:43,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:43,132 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-10-04 12:27:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:43,313 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-10-04 12:27:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:27:43,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 12:27:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:43,319 INFO L225 Difference]: With dead ends: 517 [2018-10-04 12:27:43,319 INFO L226 Difference]: Without dead ends: 515 [2018-10-04 12:27:43,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:27:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-04 12:27:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-10-04 12:27:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 12:27:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-10-04 12:27:43,399 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-10-04 12:27:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:43,399 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-10-04 12:27:43,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-10-04 12:27:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:27:43,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:43,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:43,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:43,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-10-04 12:27:43,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:43,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:43,503 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:27:43,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:43,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:43,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:43,506 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-10-04 12:27:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:43,833 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-10-04 12:27:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:27:43,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-04 12:27:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:43,838 INFO L225 Difference]: With dead ends: 799 [2018-10-04 12:27:43,839 INFO L226 Difference]: Without dead ends: 525 [2018-10-04 12:27:43,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-04 12:27:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-10-04 12:27:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 12:27:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-10-04 12:27:43,915 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-10-04 12:27:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:43,916 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-10-04 12:27:43,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-10-04 12:27:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:27:43,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:43,920 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:43,920 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:43,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-10-04 12:27:43,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:43,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:43,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:43,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:27:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:44,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:44,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:44,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:44,032 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-10-04 12:27:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:44,259 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-10-04 12:27:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:44,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-04 12:27:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:44,264 INFO L225 Difference]: With dead ends: 1207 [2018-10-04 12:27:44,265 INFO L226 Difference]: Without dead ends: 805 [2018-10-04 12:27:44,266 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:27:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-10-04 12:27:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-10-04 12:27:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-10-04 12:27:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-10-04 12:27:44,437 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-10-04 12:27:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:44,437 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-10-04 12:27:44,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-10-04 12:27:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:27:44,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:44,441 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, 1, 1] [2018-10-04 12:27:44,442 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:44,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:44,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-10-04 12:27:44,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:44,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:44,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:44,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:44,759 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:27:44,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:44,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:27:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:45,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:27:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:27:45,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:27:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:45,098 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 4 states. [2018-10-04 12:27:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:45,592 INFO L93 Difference]: Finished difference Result 2327 states and 2917 transitions. [2018-10-04 12:27:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:27:45,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-10-04 12:27:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:45,602 INFO L225 Difference]: With dead ends: 2327 [2018-10-04 12:27:45,602 INFO L226 Difference]: Without dead ends: 1525 [2018-10-04 12:27:45,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:27:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-04 12:27:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1205. [2018-10-04 12:27:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 12:27:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions. [2018-10-04 12:27:45,883 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 32 [2018-10-04 12:27:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:45,883 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions. [2018-10-04 12:27:45,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:27:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions. [2018-10-04 12:27:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 12:27:45,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:45,889 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:27:45,889 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:45,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 2 times [2018-10-04 12:27:45,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:45,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:45,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:27:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:46,605 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-10-04 12:27:47,066 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-10-04 12:27:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-04 12:27:47,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:27:47,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:27:47,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:27:47,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:27:47,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:27:47,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:27:47,787 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-10-04 12:27:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-04 12:27:48,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:27:48,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:27:48,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:27:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:27:48,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:27:48,097 INFO L87 Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 8 states. [2018-10-04 12:27:48,531 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-04 12:27:48,912 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-10-04 12:27:49,464 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-04 12:27:50,732 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-04 12:27:51,252 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-10-04 12:27:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:51,909 INFO L93 Difference]: Finished difference Result 2315 states and 2909 transitions. [2018-10-04 12:27:51,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:27:51,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-04 12:27:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:51,918 INFO L225 Difference]: With dead ends: 2315 [2018-10-04 12:27:51,918 INFO L226 Difference]: Without dead ends: 1113 [2018-10-04 12:27:51,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:27:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-10-04 12:27:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 499. [2018-10-04 12:27:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-04 12:27:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2018-10-04 12:27:52,085 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 62 [2018-10-04 12:27:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:52,086 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2018-10-04 12:27:52,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:27:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2018-10-04 12:27:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 12:27:52,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:27:52,087 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:27:52,088 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:27:52,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:27:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 929696755, now seen corresponding path program 3 times [2018-10-04 12:27:52,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:27:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:27:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:52,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:27:52,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:27:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:27:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-04 12:27:52,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:27:52,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:27:52,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:27:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:27:52,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:27:52,184 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand 3 states. [2018-10-04 12:27:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:27:52,214 INFO L93 Difference]: Finished difference Result 531 states and 654 transitions. [2018-10-04 12:27:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:27:52,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-04 12:27:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:27:52,215 INFO L225 Difference]: With dead ends: 531 [2018-10-04 12:27:52,215 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:27:52,216 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:27:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:27:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:27:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:27:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:27:52,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-10-04 12:27:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:27:52,218 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:27:52,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:27:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:27:52,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:27:52,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:27:52,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:52,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:52,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:52,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:27:52,585 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-10-04 12:27:52,804 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-10-04 12:27:53,094 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-04 12:27:53,407 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-10-04 12:27:53,646 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2018-10-04 12:27:53,791 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-10-04 12:27:53,926 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-04 12:27:53,996 INFO L421 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:53,997 INFO L421 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-10-04 12:27:53,997 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse10 (not (= ~p1_old ~nomsg))) (.cse0 (<= ~r1 0)) (.cse3 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse12 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode2 (* 256 (div ~mode2 256))) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 (= ~mode1 (* 256 (div ~mode1 256))) .cse3 .cse11 .cse12 (<= ~r1 1) .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse3 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-10-04 12:27:53,997 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-10-04 12:27:53,998 INFO L421 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (and (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:53,998 INFO L421 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:53,998 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-10-04 12:27:53,998 INFO L421 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send1 127)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send1) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 12:27:53,999 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-10-04 12:27:53,999 INFO L421 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:53,999 INFO L421 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send4) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (= 0 (+ ~nomsg 1)) (<= 0 ~r1) (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 1 ~mode2) (<= ~send1 127) (<= ~send4 127) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-10-04 12:27:53,999 INFO L421 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:53,999 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-10-04 12:27:53,999 INFO L421 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send1 127)) (.cse3 (<= ~send4 127)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send1) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse2 .cse3 (= ~mode2 (* 256 (div ~mode2 256))) .cse4 .cse5) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) .cse2 .cse3 .cse4 .cse5))) [2018-10-04 12:27:54,000 INFO L421 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:54,000 INFO L421 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (and (<= ~r1 0) (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (not (= ~p1_new ~nomsg)) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 0 ~r1)) [2018-10-04 12:27:54,000 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-10-04 12:27:54,000 INFO L421 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~mode2 1) (let ((.cse0 (<= ~r1 0)) (.cse1 (<= 0 ~send4)) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= ~send4 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 0 ~r1))) (or (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 (exists ((v_prenex_2 Int)) (let ((.cse8 (mod v_prenex_2 256))) (and (<= .cse8 127) (= ~p4_old .cse8) (<= v_prenex_2 127) (<= 0 v_prenex_2)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-10-04 12:27:54,000 INFO L421 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse1 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse2 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse10 (not (= ~p1_old ~nomsg))) (.cse0 (<= ~r1 0)) (.cse3 (<= 0 ~send4)) (.cse11 (<= 1 ~mode2)) (.cse12 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= ~send4 127)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~r1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~mode2 (* 256 (div ~mode2 256))) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 (= ~mode1 (* 256 (div ~mode1 256))) .cse3 .cse11 .cse12 (<= ~r1 1) .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse3 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-10-04 12:27:54,001 INFO L421 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 0) (<= 0 ~send4) (<= 1 ~mode2) (<= ~mode2 1) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~106) (<= 0 ~r1)) [2018-10-04 12:27:54,013 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,014 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,015 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,015 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,018 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,018 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,019 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,019 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,028 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,029 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,032 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,041 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:27:54 BoogieIcfgContainer [2018-10-04 12:27:54,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:27:54,042 INFO L168 Benchmark]: Toolchain (without parser) took 13280.35 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.9 MB). Free memory was 1.5 GB in the beginning and 946.6 MB in the end (delta: 530.1 MB). Peak memory consumption was 572.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:54,043 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:27:54,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.32 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:27:54,044 INFO L168 Benchmark]: Boogie Preprocessor took 34.22 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:27:54,045 INFO L168 Benchmark]: RCFGBuilder took 739.73 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:27:54,046 INFO L168 Benchmark]: TraceAbstraction took 12457.44 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.9 MB). Free memory was 1.4 GB in the beginning and 946.6 MB in the end (delta: 498.4 MB). Peak memory consumption was 540.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:27:54,050 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.32 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 34.22 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 739.73 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 12457.44 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 41.9 MB). Free memory was 1.4 GB in the beginning and 946.6 MB in the end (delta: 498.4 MB). Peak memory consumption was 540.3 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_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: 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: 379]: Loop Invariant Derived loop invariant: ((((((((~r1 <= 0 && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 357]: Loop Invariant [2018-10-04 12:27:54,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,060 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,061 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,063 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (1 <= ~mode2 && ~mode2 <= 1) && (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || ((((((((((!(~p1_old == ~nomsg) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) || (((((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1)) || ((((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 370]: Loop Invariant [2018-10-04 12:27:54,072 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,072 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,072 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,073 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,077 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,077 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,078 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-04 12:27:54,078 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (1 <= ~mode2 && ~mode2 <= 1) && (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && (exists v_prenex_2 : int :: ((v_prenex_2 % 256 <= 127 && ~p4_old == v_prenex_2 % 256) && v_prenex_2 <= 127) && 0 <= v_prenex_2)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~106) && 0 <= ~r1 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: (((((((((((assert_~arg <= 1 && 0 <= ~send4) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && 0 == ~nomsg + 1) && 0 <= ~r1) && !(~p1_old == ~nomsg)) && ~r1 <= 0) && 1 <= ~mode2) && ~send1 <= 127) && ~send4 <= 127) && 1 <= assert_~arg) && 1 <= check_~tmp~106 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1 - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) || ((((((((((!(~p1_old == ~nomsg) && ~mode5 == 256 * (~mode5 / 256)) && ~r1 <= 0) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1)) || (((((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1)) || ((((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((~r1 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send4) && ~send1 <= 127) && ~send4 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && 0 <= ~r1) || (((((((((!(~p1_old == ~nomsg) && ~r1 <= 0) && 0 <= ~send4) && 1 <= ~mode2) && ~mode2 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 <= ~r1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 12.3s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 331 SDslu, 305 SDs, 0 SdLazy, 229 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred 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.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 1306 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 50 NumberOfFragments, 1162 HoareAnnotationTreeSize, 16 FomulaSimplifications, 4169 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 363 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 372 ConstructedInterpolants, 17 QuantifiedInterpolants, 86420 SizeOfPredicates, 5 NumberOfNonLiveVariables, 808 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 281/315 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.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-27-54-097.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-27-54-097.csv Received shutdown request...