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.3.ufo.UNBOUNDED.pals.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:48:37,293 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:48:37,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:48:37,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:48:37,311 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:48:37,312 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:48:37,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:48:37,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:48:37,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:48:37,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:48:37,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:48:37,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:48:37,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:48:37,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:48:37,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:48:37,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:48:37,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:48:37,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:48:37,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:48:37,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:48:37,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:48:37,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:48:37,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:48:37,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:48:37,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:48:37,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:48:37,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:48:37,357 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:48:37,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:48:37,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:48:37,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:48:37,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:48:37,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:48:37,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:48:37,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:48:37,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:48:37,364 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-02 11:48:37,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:48:37,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:48:37,391 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:48:37,391 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:48:37,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:48:37,392 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:48:37,392 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:48:37,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:48:37,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:48:37,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:48:37,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:48:37,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:48:37,393 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:48:37,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:48:37,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:48:37,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:48:37,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:48:37,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:48:37,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:48:37,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:48:37,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:48:37,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:48:37,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:37,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:48:37,398 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:48:37,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:48:37,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:48:37,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:48:37,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:48:37,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:48:37,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:48:37,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:48:37,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:48:37,508 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:48:37,509 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:48:37,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl [2018-10-02 11:48:37,510 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl' [2018-10-02 11:48:37,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:48:37,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:48:37,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:37,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:48:37,593 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:48:37,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:37,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:48:37,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:48:37,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:48:37,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/1) ... [2018-10-02 11:48:37,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:48:37,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:48:37,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:48:37,698 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:48:37,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (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-02 11:48:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:48:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:48:38,275 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:48:38,276 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:38 BoogieIcfgContainer [2018-10-02 11:48:38,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:48:38,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:48:38,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:48:38,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:48:38,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:37" (1/2) ... [2018-10-02 11:48:38,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65edae78 and model type pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:38, skipping insertion in model container [2018-10-02 11:48:38,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:38" (2/2) ... [2018-10-02 11:48:38,283 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl [2018-10-02 11:48:38,293 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:48:38,301 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:48:38,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:48:38,348 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:48:38,349 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:48:38,349 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:48:38,349 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:48:38,349 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:48:38,349 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:48:38,349 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:48:38,350 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:48:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-02 11:48:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:48:38,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:38,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:38,376 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:38,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:38,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1167247609, now seen corresponding path program 1 times [2018-10-02 11:48:38,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:38,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:38,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:38,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:38,606 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-02 11:48:38,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:38,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:38,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:38,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:38,630 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-02 11:48:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:38,698 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-10-02 11:48:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:38,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-02 11:48:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:38,711 INFO L225 Difference]: With dead ends: 42 [2018-10-02 11:48:38,711 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 11:48:38,715 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-02 11:48:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 11:48:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-02 11:48:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 11:48:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-10-02 11:48:38,758 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-10-02 11:48:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:38,758 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-10-02 11:48:38,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-10-02 11:48:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:48:38,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:38,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:38,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:38,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1352712325, now seen corresponding path program 1 times [2018-10-02 11:48:38,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:38,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:38,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:38,926 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-02 11:48:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:38,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:48:38,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:38,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:38,929 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-10-02 11:48:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:39,055 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-10-02 11:48:39,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:48:39,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-02 11:48:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:39,057 INFO L225 Difference]: With dead ends: 53 [2018-10-02 11:48:39,058 INFO L226 Difference]: Without dead ends: 51 [2018-10-02 11:48:39,059 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-02 11:48:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-02 11:48:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-10-02 11:48:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 11:48:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-02 11:48:39,071 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-10-02 11:48:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:39,071 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-02 11:48:39,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-02 11:48:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:48:39,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:39,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:39,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:39,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:39,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1352652743, now seen corresponding path program 1 times [2018-10-02 11:48:39,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:39,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:39,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:39,238 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-02 11:48:39,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:39,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:39,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:48:39,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:48:39,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:48:39,240 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2018-10-02 11:48:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:39,397 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-10-02 11:48:39,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:48:39,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-02 11:48:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:39,400 INFO L225 Difference]: With dead ends: 97 [2018-10-02 11:48:39,400 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 11:48:39,401 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-02 11:48:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 11:48:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-02 11:48:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-02 11:48:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2018-10-02 11:48:39,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 13 [2018-10-02 11:48:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:39,422 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-10-02 11:48:39,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:48:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2018-10-02 11:48:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:48:39,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:39,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:39,424 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:39,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash 90659497, now seen corresponding path program 1 times [2018-10-02 11:48:39,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:39,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-02 11:48:39,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:39,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:39,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:39,515 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand 3 states. [2018-10-02 11:48:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:39,582 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-10-02 11:48:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:39,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-02 11:48:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:39,586 INFO L225 Difference]: With dead ends: 163 [2018-10-02 11:48:39,586 INFO L226 Difference]: Without dead ends: 117 [2018-10-02 11:48:39,587 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-02 11:48:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-02 11:48:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-02 11:48:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-02 11:48:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2018-10-02 11:48:39,618 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 24 [2018-10-02 11:48:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:39,619 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2018-10-02 11:48:39,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2018-10-02 11:48:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 11:48:39,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:39,621 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:48:39,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:39,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash -726110997, now seen corresponding path program 1 times [2018-10-02 11:48:39,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:39,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:39,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:39,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:39,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-02 11:48:39,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:39,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:39,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:39,820 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand 3 states. [2018-10-02 11:48:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:39,908 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2018-10-02 11:48:39,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:39,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-02 11:48:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:39,917 INFO L225 Difference]: With dead ends: 339 [2018-10-02 11:48:39,918 INFO L226 Difference]: Without dead ends: 227 [2018-10-02 11:48:39,919 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-02 11:48:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-02 11:48:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-02 11:48:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-02 11:48:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-10-02 11:48:40,009 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 46 [2018-10-02 11:48:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:40,009 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-10-02 11:48:40,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-10-02 11:48:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 11:48:40,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:40,013 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:48:40,013 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:40,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2107769241, now seen corresponding path program 1 times [2018-10-02 11:48:40,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:40,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:40,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:40,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:40,300 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-02 11:48:40,649 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-10-02 11:48:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-02 11:48:40,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:48:40,674 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-02 11:48:40,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:40,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:48:41,388 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-02 11:48:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-02 11:48:41,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:48:41,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-10-02 11:48:41,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:48:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:48:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:48:41,939 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 10 states. [2018-10-02 11:48:42,252 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-02 11:48:42,859 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-02 11:48:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:44,622 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2018-10-02 11:48:44,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:48:44,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-10-02 11:48:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:44,624 INFO L225 Difference]: With dead ends: 541 [2018-10-02 11:48:44,624 INFO L226 Difference]: Without dead ends: 196 [2018-10-02 11:48:44,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:48:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-02 11:48:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-10-02 11:48:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-02 11:48:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-10-02 11:48:44,667 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 46 [2018-10-02 11:48:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:44,668 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-10-02 11:48:44,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:48:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-10-02 11:48:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 11:48:44,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:44,675 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-02 11:48:44,675 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:44,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash 702690737, now seen corresponding path program 2 times [2018-10-02 11:48:44,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:44,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:44,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:44,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-02 11:48:44,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:44,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:44,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:44,773 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 3 states. [2018-10-02 11:48:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:44,780 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-10-02 11:48:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:44,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-02 11:48:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:44,781 INFO L225 Difference]: With dead ends: 157 [2018-10-02 11:48:44,781 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:48:44,782 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-02 11:48:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:48:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:48:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:48:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:48:44,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-10-02 11:48:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:44,783 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:48:44,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:48:44,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:48:44,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:48:45,714 WARN L178 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-02 11:48:46,209 WARN L178 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-02 11:48:46,349 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-02 11:48:46,550 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-10-02 11:48:46,818 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-02 11:48:47,021 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-10-02 11:48:47,066 INFO L421 ceAbstractionStarter]: At program point L225(lines 217 226) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-10-02 11:48:47,066 INFO L421 ceAbstractionStarter]: At program point L289(lines 289 295) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~63) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:47,066 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 51 301) no Hoare annotation was computed. [2018-10-02 11:48:47,066 INFO L421 ceAbstractionStarter]: At program point L184(lines 184 195) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .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-02 11:48:47,066 INFO L421 ceAbstractionStarter]: At program point L279(lines 274 280) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~63) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:47,067 INFO L421 ceAbstractionStarter]: At program point L203(lines 194 204) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse4 (* 256 (div ~r1 256))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 (<= ~r1 .cse4)) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 (<= ~r1 (+ .cse4 2)) .cse1 .cse2 .cse3))) [2018-10-02 11:48:47,067 INFO L421 ceAbstractionStarter]: At program point L298(lines 298 299) the Hoare annotation is: false [2018-10-02 11:48:47,067 INFO L421 ceAbstractionStarter]: At program point L230(lines 230 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-10-02 11:48:47,067 INFO L421 ceAbstractionStarter]: At program point L294(lines 177 294) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .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-02 11:48:47,067 INFO L421 ceAbstractionStarter]: At program point L259(lines 259 265) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:47,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 300) no Hoare annotation was computed. [2018-10-02 11:48:47,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 51 301) no Hoare annotation was computed. [2018-10-02 11:48:47,068 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 301) no Hoare annotation was computed. [2018-10-02 11:48:47,068 INFO L421 ceAbstractionStarter]: At program point L247(lines 239 248) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse1 (* 256 (div ~r1 256)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 (+ .cse1 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 .cse1)))) [2018-10-02 11:48:47,068 INFO L421 ceAbstractionStarter]: At program point L208(lines 208 218) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse4 (* 256 (div ~r1 256))) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 (<= ~r1 .cse4)) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 (<= ~r1 (+ .cse4 2)) .cse1 .cse2 .cse3))) [2018-10-02 11:48:47,069 INFO L421 ceAbstractionStarter]: At program point L268(lines 264 275) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1))) [2018-10-02 11:48:47,091 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:48:47 BoogieIcfgContainer [2018-10-02 11:48:47,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:48:47,095 INFO L168 Benchmark]: Toolchain (without parser) took 9502.95 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -52.5 MB). Peak memory consumption was 489.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:47,097 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:47,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:47,101 INFO L168 Benchmark]: Boogie Preprocessor took 52.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:48:47,102 INFO L168 Benchmark]: RCFGBuilder took 578.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:47,103 INFO L168 Benchmark]: TraceAbstraction took 8814.49 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -84.2 MB). Peak memory consumption was 457.4 MB. Max. memory is 7.1 GB. [2018-10-02 11:48:47,113 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 578.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8814.49 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 39.3 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -84.2 MB). Peak memory consumption was 457.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 300]: 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: 298]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 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) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && 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) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 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: 230]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && 1 <= check_~tmp~63) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 1 <= check_~tmp~63) && 0 == ~nomsg + 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 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: 259]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 8.7s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 204 SDslu, 174 SDs, 0 SdLazy, 406 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=5, 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, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 139 NumberOfFragments, 755 HoareAnnotationTreeSize, 12 FomulaSimplifications, 5961 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 28 QuantifiedInterpolants, 50606 SizeOfPredicates, 7 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 326/374 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.3.ufo.UNBOUNDED.pals.c_14.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-48-47-148.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.3.ufo.UNBOUNDED.pals.c_14.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-48-47-148.csv Received shutdown request...