java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:44:25,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:44:25,662 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:44:25,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:44:25,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:44:25,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:44:25,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:44:25,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:44:25,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:44:25,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:44:25,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:44:25,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:44:25,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:44:25,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:44:25,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:44:25,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:44:25,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:44:25,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:44:25,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:44:25,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:44:25,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:44:25,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:44:25,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:44:25,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:44:25,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:44:25,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:44:25,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:44:25,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:44:25,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:44:25,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:44:25,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:44:25,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:44:25,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:44:25,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:44:25,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:44:25,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:44:25,718 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:44:25,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:44:25,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:44:25,749 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:44:25,749 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:44:25,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:44:25,750 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:44:25,751 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:44:25,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:44:25,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:44:25,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:44:25,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:44:25,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:44:25,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:44:25,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:44:25,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:44:25,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:44:25,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:44:25,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:44:25,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:44:25,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:44:25,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:44:25,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:44:25,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:44:25,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:44:25,757 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:44:25,757 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:44:25,757 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:44:25,757 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:44:25,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:44:25,758 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:44:25,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:44:25,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:44:25,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:44:25,832 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:44:25,833 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:44:25,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-23 19:44:25,834 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl' [2018-09-23 19:44:25,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:44:25,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:44:25,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:44:25,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:44:25,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:44:25,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:25,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:44:26,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:44:26,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:44:26,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:44:26,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... [2018-09-23 19:44:26,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:44:26,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:44:26,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:44:26,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:44:26,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:44:26,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-23 19:44:26,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-23 19:44:26,862 INFO L354 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-23 19:44:26,862 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:44:26 BoogieIcfgContainer [2018-09-23 19:44:26,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:44:26,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:44:26,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:44:26,867 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:44:26,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:44:25" (1/2) ... [2018-09-23 19:44:26,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303f2d97 and model type pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:44:26, skipping insertion in model container [2018-09-23 19:44:26,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:44:26" (2/2) ... [2018-09-23 19:44:26,871 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl [2018-09-23 19:44:26,881 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:44:26,889 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:44:26,939 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:44:26,940 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:44:26,941 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:44:26,941 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:44:26,941 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:44:26,941 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:44:26,941 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:44:26,942 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:44:26,942 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:44:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-09-23 19:44:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:26,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:26,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:26,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:26,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1899574627, now seen corresponding path program 1 times [2018-09-23 19:44:26,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:26,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:27,322 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:27,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:27,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:27,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:27,347 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-09-23 19:44:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:27,427 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2018-09-23 19:44:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:27,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-23 19:44:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:27,445 INFO L225 Difference]: With dead ends: 57 [2018-09-23 19:44:27,445 INFO L226 Difference]: Without dead ends: 37 [2018-09-23 19:44:27,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-23 19:44:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-09-23 19:44:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-23 19:44:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-23 19:44:27,496 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 18 [2018-09-23 19:44:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:27,496 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-23 19:44:27,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-23 19:44:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:27,497 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:27,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:27,498 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:27,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1374324315, now seen corresponding path program 1 times [2018-09-23 19:44:27,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:27,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:27,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:27,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:27,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:27,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:27,672 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-23 19:44:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:27,727 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2018-09-23 19:44:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:27,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-23 19:44:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:27,730 INFO L225 Difference]: With dead ends: 103 [2018-09-23 19:44:27,730 INFO L226 Difference]: Without dead ends: 69 [2018-09-23 19:44:27,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-23 19:44:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-23 19:44:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-23 19:44:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2018-09-23 19:44:27,754 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 18 [2018-09-23 19:44:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:27,754 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2018-09-23 19:44:27,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2018-09-23 19:44:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:27,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:27,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:27,756 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:27,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1632489753, now seen corresponding path program 1 times [2018-09-23 19:44:27,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:27,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:27,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:27,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:44:27,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:44:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:44:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:44:27,959 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand 4 states. [2018-09-23 19:44:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:28,140 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2018-09-23 19:44:28,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:44:28,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-09-23 19:44:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:28,153 INFO L225 Difference]: With dead ends: 141 [2018-09-23 19:44:28,153 INFO L226 Difference]: Without dead ends: 139 [2018-09-23 19:44:28,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:44:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-23 19:44:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-09-23 19:44:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-23 19:44:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-09-23 19:44:28,202 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 18 [2018-09-23 19:44:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:28,203 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-09-23 19:44:28,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:44:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-09-23 19:44:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 19:44:28,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:28,204 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:28,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:28,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:28,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1632549335, now seen corresponding path program 1 times [2018-09-23 19:44:28,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:28,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:28,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:28,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:28,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:28,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:28,364 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 3 states. [2018-09-23 19:44:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:28,468 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2018-09-23 19:44:28,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:28,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-09-23 19:44:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:28,472 INFO L225 Difference]: With dead ends: 183 [2018-09-23 19:44:28,475 INFO L226 Difference]: Without dead ends: 109 [2018-09-23 19:44:28,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-23 19:44:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-23 19:44:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 19:44:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2018-09-23 19:44:28,510 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 18 [2018-09-23 19:44:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:28,513 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2018-09-23 19:44:28,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2018-09-23 19:44:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:28,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:28,516 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:28,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:28,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash 882399407, now seen corresponding path program 1 times [2018-09-23 19:44:28,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:28,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:28,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:28,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:28,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:28,617 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 3 states. [2018-09-23 19:44:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:28,700 INFO L93 Difference]: Finished difference Result 321 states and 435 transitions. [2018-09-23 19:44:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:28,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:28,702 INFO L225 Difference]: With dead ends: 321 [2018-09-23 19:44:28,702 INFO L226 Difference]: Without dead ends: 215 [2018-09-23 19:44:28,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-23 19:44:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-09-23 19:44:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-23 19:44:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2018-09-23 19:44:28,745 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 34 [2018-09-23 19:44:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:28,746 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2018-09-23 19:44:28,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2018-09-23 19:44:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:28,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:28,748 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:28,749 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:28,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1893516657, now seen corresponding path program 1 times [2018-09-23 19:44:28,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:28,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:28,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:28,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:28,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:28,903 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand 3 states. [2018-09-23 19:44:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:29,023 INFO L93 Difference]: Finished difference Result 633 states and 846 transitions. [2018-09-23 19:44:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:29,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:29,027 INFO L225 Difference]: With dead ends: 633 [2018-09-23 19:44:29,028 INFO L226 Difference]: Without dead ends: 423 [2018-09-23 19:44:29,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-23 19:44:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-09-23 19:44:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-23 19:44:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2018-09-23 19:44:29,130 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 34 [2018-09-23 19:44:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:29,131 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2018-09-23 19:44:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2018-09-23 19:44:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:29,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:29,137 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:29,138 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:29,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2008423629, now seen corresponding path program 1 times [2018-09-23 19:44:29,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:29,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:29,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:29,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:29,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:29,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:29,322 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2018-09-23 19:44:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:29,527 INFO L93 Difference]: Finished difference Result 1257 states and 1650 transitions. [2018-09-23 19:44:29,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:29,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:29,533 INFO L225 Difference]: With dead ends: 1257 [2018-09-23 19:44:29,533 INFO L226 Difference]: Without dead ends: 839 [2018-09-23 19:44:29,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-09-23 19:44:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 837. [2018-09-23 19:44:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-09-23 19:44:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1076 transitions. [2018-09-23 19:44:29,677 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1076 transitions. Word has length 34 [2018-09-23 19:44:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:29,678 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1076 transitions. [2018-09-23 19:44:29,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1076 transitions. [2018-09-23 19:44:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:29,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:29,686 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:29,686 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:29,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1477197041, now seen corresponding path program 1 times [2018-09-23 19:44:29,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:29,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:29,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:29,855 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:29,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:29,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:29,857 INFO L87 Difference]: Start difference. First operand 837 states and 1076 transitions. Second operand 3 states. [2018-09-23 19:44:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:30,201 INFO L93 Difference]: Finished difference Result 2505 states and 3222 transitions. [2018-09-23 19:44:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:30,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-23 19:44:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:30,211 INFO L225 Difference]: With dead ends: 2505 [2018-09-23 19:44:30,211 INFO L226 Difference]: Without dead ends: 1671 [2018-09-23 19:44:30,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-23 19:44:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669. [2018-09-23 19:44:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2018-09-23 19:44:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2018-09-23 19:44:30,452 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 34 [2018-09-23 19:44:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:30,453 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2018-09-23 19:44:30,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2018-09-23 19:44:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-23 19:44:30,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:30,457 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:44:30,457 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:30,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1419938739, now seen corresponding path program 1 times [2018-09-23 19:44:30,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:30,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:30,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:30,649 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-23 19:44:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:44:30,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:44:30,821 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:44:30,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:30,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:44:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-23 19:44:31,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:44:31,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-09-23 19:44:31,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:44:31,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:44:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:44:31,218 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand 7 states. [2018-09-23 19:44:31,445 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-23 19:44:31,792 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:44:32,426 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:44:32,867 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-23 19:44:33,265 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-23 19:44:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:35,390 INFO L93 Difference]: Finished difference Result 4801 states and 6018 transitions. [2018-09-23 19:44:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:44:35,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-09-23 19:44:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:35,406 INFO L225 Difference]: With dead ends: 4801 [2018-09-23 19:44:35,406 INFO L226 Difference]: Without dead ends: 3135 [2018-09-23 19:44:35,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:44:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2018-09-23 19:44:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2101. [2018-09-23 19:44:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-09-23 19:44:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2608 transitions. [2018-09-23 19:44:35,821 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2608 transitions. Word has length 34 [2018-09-23 19:44:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:35,821 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 2608 transitions. [2018-09-23 19:44:35,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:44:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2608 transitions. [2018-09-23 19:44:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-23 19:44:35,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:35,826 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-23 19:44:35,826 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:35,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash 789936545, now seen corresponding path program 2 times [2018-09-23 19:44:35,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:35,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:35,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:44:35,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-23 19:44:36,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:36,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:44:36,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:36,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:36,030 INFO L87 Difference]: Start difference. First operand 2101 states and 2608 transitions. Second operand 3 states. [2018-09-23 19:44:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:36,551 INFO L93 Difference]: Finished difference Result 4873 states and 6002 transitions. [2018-09-23 19:44:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:36,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-23 19:44:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:36,561 INFO L225 Difference]: With dead ends: 4873 [2018-09-23 19:44:36,561 INFO L226 Difference]: Without dead ends: 2215 [2018-09-23 19:44:36,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2018-09-23 19:44:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 1797. [2018-09-23 19:44:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2018-09-23 19:44:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2175 transitions. [2018-09-23 19:44:36,903 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2175 transitions. Word has length 66 [2018-09-23 19:44:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:36,903 INFO L480 AbstractCegarLoop]: Abstraction has 1797 states and 2175 transitions. [2018-09-23 19:44:36,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2175 transitions. [2018-09-23 19:44:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-23 19:44:36,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:44:36,909 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-23 19:44:36,909 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:44:36,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:44:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2008030493, now seen corresponding path program 3 times [2018-09-23 19:44:36,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:44:36,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:44:36,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:36,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:44:36,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:44:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:44:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-23 19:44:37,000 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:44:37,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:44:37,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:44:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:44:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:37,003 INFO L87 Difference]: Start difference. First operand 1797 states and 2175 transitions. Second operand 3 states. [2018-09-23 19:44:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:44:37,044 INFO L93 Difference]: Finished difference Result 1799 states and 2177 transitions. [2018-09-23 19:44:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:44:37,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-23 19:44:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:44:37,047 INFO L225 Difference]: With dead ends: 1799 [2018-09-23 19:44:37,047 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 19:44:37,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:44:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 19:44:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 19:44:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 19:44:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 19:44:37,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2018-09-23 19:44:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:44:37,051 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 19:44:37,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:44:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 19:44:37,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 19:44:37,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 19:44:37,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,215 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2018-09-23 19:44:37,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:37,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:38,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 19:44:39,059 WARN L178 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-09-23 19:44:39,288 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:39,569 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:39,769 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:40,053 WARN L178 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-23 19:44:40,192 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:40,478 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:40,606 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:40,751 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:40,906 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-09-23 19:44:41,108 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-09-23 19:44:41,112 INFO L422 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-23 19:44:41,112 INFO L422 ceAbstractionStarter]: At program point L539(lines 364 539) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:41,112 INFO L422 ceAbstractionStarter]: At program point L436(lines 436 446) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,113 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 426) the Hoare annotation is: (let ((.cse0 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse6 (not (= ~p2_new ~nomsg))) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse7 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse7 1)) (<= .cse7 0)))) .cse4 .cse5 .cse6) (and (<= ~mode3 1) (<= 1 ~mode3) (and (not (= ~p2_old ~nomsg)) .cse3 .cse4 .cse5)))) [2018-09-23 19:44:41,113 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 108 542) no Hoare annotation was computed. [2018-09-23 19:44:41,113 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 108 542) no Hoare annotation was computed. [2018-09-23 19:44:41,113 INFO L422 ceAbstractionStarter]: At program point L536(lines 536 540) the Hoare annotation is: false [2018-09-23 19:44:41,113 INFO L422 ceAbstractionStarter]: At program point L371(lines 371 383) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:41,114 INFO L422 ceAbstractionStarter]: At program point L491(lines 485 492) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,114 INFO L422 ceAbstractionStarter]: At program point L520(lines 515 521) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-23 19:44:41,114 INFO L422 ceAbstractionStarter]: At program point L388(lines 382 389) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:41,114 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 541) no Hoare annotation was computed. [2018-09-23 19:44:41,114 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 108 542) no Hoare annotation was computed. [2018-09-23 19:44:41,115 INFO L422 ceAbstractionStarter]: At program point L471(lines 464 472) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,115 INFO L422 ceAbstractionStarter]: At program point L393(lines 393 403) the Hoare annotation is: (let ((.cse0 (<= ~send2 127)) (.cse1 (<= 0 ~send2)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (and (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (= ~mode2 (* 256 (div ~mode2 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~mode2 1) .cse0 .cse1 (<= ~mode3 1) (<= 1 ~mode3) .cse2))) [2018-09-23 19:44:41,115 INFO L422 ceAbstractionStarter]: At program point L451(lines 445 452) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,116 INFO L422 ceAbstractionStarter]: At program point L509(lines 509 516) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse4 .cse5 .cse6 .cse7))) [2018-09-23 19:44:41,116 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 486) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,116 INFO L422 ceAbstractionStarter]: At program point L530(lines 530 537) the Hoare annotation is: (and (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ULTIMATE.start_check_~tmp~158) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send2 127) (<= 0 ~send2) (<= ~mode3 1) (<= 1 ~mode3) (= 0 (+ ~nomsg 1))) [2018-09-23 19:44:41,116 INFO L422 ceAbstractionStarter]: At program point L431(lines 425 432) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,117 INFO L422 ceAbstractionStarter]: At program point L456(lines 456 465) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~mode2 1)) (.cse2 (<= ~send2 127)) (.cse4 (<= 0 ~send2)) (.cse5 (<= ~mode3 1)) (.cse6 (<= 1 ~mode3)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256))) .cse8))) [2018-09-23 19:44:41,131 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,132 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,135 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,137 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,138 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,139 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,141 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,142 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,143 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,145 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,147 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,149 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,151 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,153 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,154 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,155 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,157 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,158 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,159 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,165 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,172 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:44:41 BoogieIcfgContainer [2018-09-23 19:44:41,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:44:41,174 INFO L168 Benchmark]: Toolchain (without parser) took 15225.13 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 155.7 MB). Free memory was 1.5 GB in the beginning and 973.3 MB in the end (delta: 496.5 MB). Peak memory consumption was 652.2 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:41,175 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:44:41,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:44:41,176 INFO L168 Benchmark]: Boogie Preprocessor took 61.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:44:41,177 INFO L168 Benchmark]: RCFGBuilder took 779.65 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:41,177 INFO L168 Benchmark]: TraceAbstraction took 14308.84 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 155.7 MB). Free memory was 1.4 GB in the beginning and 973.3 MB in the end (delta: 443.7 MB). Peak memory consumption was 599.4 MB. Max. memory is 7.1 GB. [2018-09-23 19:44:41,181 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.20 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 66.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.72 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 779.65 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14308.84 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 155.7 MB). Free memory was 1.4 GB in the beginning and 973.3 MB in the end (delta: 443.7 MB). Peak memory consumption was 599.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 541]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 445]: Loop Invariant [2018-09-23 19:44:41,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,193 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 464]: Loop Invariant [2018-09-23 19:44:41,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 485]: Loop Invariant [2018-09-23 19:44:41,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,197 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 416]: Loop Invariant [2018-09-23 19:44:41,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 436]: Loop Invariant [2018-09-23 19:44:41,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 456]: Loop Invariant [2018-09-23 19:44:41,204 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,204 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,205 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 509]: Loop Invariant [2018-09-23 19:44:41,206 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,207 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,208 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((assert_~arg == 1 && !(~p2_old == ~nomsg)) && 1 <= check_~tmp~158) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1 - InvariantResult [Line: 476]: Loop Invariant [2018-09-23 19:44:41,209 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,209 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,210 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,210 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) - InvariantResult [Line: 402]: Loop Invariant [2018-09-23 19:44:41,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,211 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,212 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg))) || ((~mode3 <= 1 && 1 <= ~mode3) && ((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 <= ~send2) && 0 == ~nomsg + 1) - InvariantResult [Line: 425]: Loop Invariant [2018-09-23 19:44:41,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,213 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,214 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-09-23 19:44:41,214 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~mode2 <= 1) && ~send2 <= 127) && 0 <= ~send2) && ~mode3 <= 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 327 SDslu, 307 SDs, 0 SdLazy, 224 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2101occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1528 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 581 NumberOfFragments, 1160 HoareAnnotationTreeSize, 17 FomulaSimplifications, 70439 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 49682 SizeOfPredicates, 1 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 270/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-44-41-224.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_12.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-44-41-224.csv Received shutdown request...