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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:14:20,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:14:20,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:14:20,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:14:20,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:14:20,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:14:20,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:14:20,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:14:20,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:14:20,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:14:20,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:14:20,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:14:20,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:14:20,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:14:20,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:14:20,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:14:20,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:14:20,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:14:20,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:14:20,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:14:20,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:14:20,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:14:20,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:14:20,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:14:20,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:14:20,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:14:20,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:14:20,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:14:20,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:14:20,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:14:20,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:14:20,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:14:20,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:14:20,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:14:20,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:14:20,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:14:20,779 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:14:20,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:14:20,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:14:20,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:14:20,796 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:14:20,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:14:20,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:14:20,797 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:14:20,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:14:20,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:14:20,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:14:20,799 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:14:20,799 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:14:20,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:14:20,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:14:20,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:14:20,800 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:14:20,800 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:14:20,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:14:20,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:14:20,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:14:20,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:14:20,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:14:20,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:14:20,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:14:20,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:14:20,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:14:20,803 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:14:20,803 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:14:20,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:14:20,804 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:14:20,804 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:14:20,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:14:20,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:14:20,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:14:20,865 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:14:20,866 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:14:20,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-03 09:14:20,867 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl' [2018-10-03 09:14:20,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:14:20,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:14:20,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:14:20,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:14:20,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:14:20,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:14:21,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:14:21,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:14:21,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:14:21,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... [2018-10-03 09:14:21,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:14:21,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:14:21,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:14:21,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:14:21,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:14:21,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:14:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:14:21,794 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:14:21,795 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:14:21 BoogieIcfgContainer [2018-10-03 09:14:21,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:14:21,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:14:21,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:14:21,803 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:14:21,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:14:20" (1/2) ... [2018-10-03 09:14:21,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5644d295 and model type pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:14:21, skipping insertion in model container [2018-10-03 09:14:21,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:14:21" (2/2) ... [2018-10-03 09:14:21,807 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl [2018-10-03 09:14:21,817 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:14:21,826 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:14:21,866 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:14:21,867 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:14:21,867 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:14:21,867 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:14:21,867 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:14:21,867 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:14:21,868 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:14:21,868 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:14:21,868 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:14:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-03 09:14:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:14:21,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:21,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:21,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:21,898 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash -417618663, now seen corresponding path program 1 times [2018-10-03 09:14:21,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:22,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:14:22,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:22,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:22,181 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-03 09:14:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:22,236 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-10-03 09:14:22,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:22,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-03 09:14:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:22,251 INFO L225 Difference]: With dead ends: 51 [2018-10-03 09:14:22,251 INFO L226 Difference]: Without dead ends: 33 [2018-10-03 09:14:22,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-03 09:14:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-03 09:14:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-03 09:14:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-10-03 09:14:22,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-10-03 09:14:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:22,292 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-10-03 09:14:22,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-10-03 09:14:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:14:22,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:22,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:22,294 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:22,294 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735913, now seen corresponding path program 1 times [2018-10-03 09:14:22,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:22,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:22,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:22,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:14:22,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:22,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:22,456 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-10-03 09:14:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:22,507 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-10-03 09:14:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:22,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-03 09:14:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:22,510 INFO L225 Difference]: With dead ends: 91 [2018-10-03 09:14:22,510 INFO L226 Difference]: Without dead ends: 61 [2018-10-03 09:14:22,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-03 09:14:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-03 09:14:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-03 09:14:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-10-03 09:14:22,542 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-10-03 09:14:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:22,542 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-10-03 09:14:22,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-10-03 09:14:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:14:22,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:22,543 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:22,543 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:22,544 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762923, now seen corresponding path program 1 times [2018-10-03 09:14:22,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:22,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:22,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:14:22,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:22,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:22,669 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-10-03 09:14:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:22,748 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-10-03 09:14:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:22,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-03 09:14:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:22,756 INFO L225 Difference]: With dead ends: 175 [2018-10-03 09:14:22,757 INFO L226 Difference]: Without dead ends: 117 [2018-10-03 09:14:22,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-03 09:14:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-03 09:14:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-03 09:14:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-10-03 09:14:22,815 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-10-03 09:14:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:22,816 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-10-03 09:14:22,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-10-03 09:14:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:14:22,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:22,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:22,820 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:22,821 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:22,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1764504621, now seen corresponding path program 1 times [2018-10-03 09:14:22,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:22,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:22,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:14:22,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:14:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:14:22,976 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:22,976 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 4 states. [2018-10-03 09:14:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:23,114 INFO L93 Difference]: Finished difference Result 245 states and 331 transitions. [2018-10-03 09:14:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:14:23,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-03 09:14:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:23,118 INFO L225 Difference]: With dead ends: 245 [2018-10-03 09:14:23,118 INFO L226 Difference]: Without dead ends: 243 [2018-10-03 09:14:23,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-03 09:14:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-03 09:14:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 131. [2018-10-03 09:14:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-03 09:14:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2018-10-03 09:14:23,180 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 16 [2018-10-03 09:14:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:23,181 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2018-10-03 09:14:23,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:14:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2018-10-03 09:14:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 09:14:23,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:23,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:23,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:23,183 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1764564203, now seen corresponding path program 1 times [2018-10-03 09:14:23,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:23,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:23,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:23,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:23,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:23,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:14:23,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:23,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:23,265 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand 3 states. [2018-10-03 09:14:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:23,371 INFO L93 Difference]: Finished difference Result 319 states and 425 transitions. [2018-10-03 09:14:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:23,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-03 09:14:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:23,374 INFO L225 Difference]: With dead ends: 319 [2018-10-03 09:14:23,374 INFO L226 Difference]: Without dead ends: 189 [2018-10-03 09:14:23,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-03 09:14:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-03 09:14:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-03 09:14:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-10-03 09:14:23,438 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 16 [2018-10-03 09:14:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:23,442 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-10-03 09:14:23,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-10-03 09:14:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:14:23,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:23,445 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] [2018-10-03 09:14:23,445 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:23,445 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1265916431, now seen corresponding path program 1 times [2018-10-03 09:14:23,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:23,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:23,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:23,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:23,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:23,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:14:23,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:23,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:23,583 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:23,584 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-10-03 09:14:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:23,710 INFO L93 Difference]: Finished difference Result 561 states and 738 transitions. [2018-10-03 09:14:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:23,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 09:14:23,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:23,713 INFO L225 Difference]: With dead ends: 561 [2018-10-03 09:14:23,714 INFO L226 Difference]: Without dead ends: 375 [2018-10-03 09:14:23,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-03 09:14:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-10-03 09:14:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-03 09:14:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-10-03 09:14:23,785 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 30 [2018-10-03 09:14:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:23,786 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-10-03 09:14:23,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-10-03 09:14:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:14:23,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:23,789 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:23,789 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:23,789 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1524081869, now seen corresponding path program 1 times [2018-10-03 09:14:23,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:23,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:23,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:23,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:23,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:23,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:23,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:14:23,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:23,903 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:23,903 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-10-03 09:14:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:24,102 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-10-03 09:14:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:24,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 09:14:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:24,109 INFO L225 Difference]: With dead ends: 1113 [2018-10-03 09:14:24,110 INFO L226 Difference]: Without dead ends: 743 [2018-10-03 09:14:24,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-10-03 09:14:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-10-03 09:14:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-03 09:14:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-10-03 09:14:24,251 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-10-03 09:14:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:24,251 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-10-03 09:14:24,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-10-03 09:14:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:14:24,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:24,260 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:14:24,261 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:24,261 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash -714735243, now seen corresponding path program 1 times [2018-10-03 09:14:24,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:14:24,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:14:24,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:14:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:24,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:14:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-03 09:14:25,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:14:25,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-10-03 09:14:25,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:14:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:14:25,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:25,505 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 7 states. [2018-10-03 09:14:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:28,771 INFO L93 Difference]: Finished difference Result 1609 states and 2019 transitions. [2018-10-03 09:14:28,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 09:14:28,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-03 09:14:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:28,776 INFO L225 Difference]: With dead ends: 1609 [2018-10-03 09:14:28,776 INFO L226 Difference]: Without dead ends: 565 [2018-10-03 09:14:28,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.2s impTime 16 [2018-10-03 09:14:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-03 09:14:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 515. [2018-10-03 09:14:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-03 09:14:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 606 transitions. [2018-10-03 09:14:28,898 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 606 transitions. Word has length 30 [2018-10-03 09:14:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:28,899 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 606 transitions. [2018-10-03 09:14:28,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:14:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 606 transitions. [2018-10-03 09:14:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-03 09:14:28,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:14:28,904 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-03 09:14:28,905 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:14:28,905 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:14:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1918843925, now seen corresponding path program 2 times [2018-10-03 09:14:28,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:14:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:14:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:14:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:14:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:14:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-03 09:14:29,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:14:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:14:29,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:14:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:14:29,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:14:29,007 INFO L87 Difference]: Start difference. First operand 515 states and 606 transitions. Second operand 3 states. [2018-10-03 09:14:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:14:29,026 INFO L93 Difference]: Finished difference Result 515 states and 606 transitions. [2018-10-03 09:14:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:14:29,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-03 09:14:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:14:29,027 INFO L225 Difference]: With dead ends: 515 [2018-10-03 09:14:29,027 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:14:29,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:14:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:14:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:14:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:14:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:14:29,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-03 09:14:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:14:29,029 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:14:29,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:14:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:14:29,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:14:29,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:14:29,573 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-03 09:14:30,511 WARN L178 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-03 09:14:30,614 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-03 09:14:31,063 WARN L178 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-03 09:14:31,225 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-03 09:14:31,760 WARN L178 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-10-03 09:14:32,113 WARN L178 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-03 09:14:32,652 WARN L178 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-03 09:14:32,755 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-03 09:14:32,893 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-03 09:14:33,104 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-10-03 09:14:33,219 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-03 09:14:33,222 INFO L421 ceAbstractionStarter]: At program point L415(lines 409 416) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~mode2 1)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse5 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse5 1)) (<= .cse5 0)))) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-10-03 09:14:33,223 INFO L421 ceAbstractionStarter]: At program point L461(lines 308 461) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-03 09:14:33,223 INFO L421 ceAbstractionStarter]: At program point L395(lines 389 396) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-03 09:14:33,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 463) no Hoare annotation was computed. [2018-10-03 09:14:33,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 464) no Hoare annotation was computed. [2018-10-03 09:14:33,223 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 464) no Hoare annotation was computed. [2018-10-03 09:14:33,223 INFO L421 ceAbstractionStarter]: At program point L375(lines 369 376) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-03 09:14:33,223 INFO L421 ceAbstractionStarter]: At program point L400(lines 400 410) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-03 09:14:33,224 INFO L421 ceAbstractionStarter]: At program point L458(lines 458 462) the Hoare annotation is: false [2018-10-03 09:14:33,224 INFO L421 ceAbstractionStarter]: At program point L355(lines 349 356) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-10-03 09:14:33,224 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 464) no Hoare annotation was computed. [2018-10-03 09:14:33,224 INFO L421 ceAbstractionStarter]: At program point L380(lines 380 390) the Hoare annotation is: (let ((.cse7 (<= ~r1 (* 256 (div ~r1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6))) [2018-10-03 09:14:33,224 INFO L421 ceAbstractionStarter]: At program point L442(lines 438 443) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~129)) [2018-10-03 09:14:33,225 INFO L421 ceAbstractionStarter]: At program point L335(lines 326 336) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-10-03 09:14:33,225 INFO L421 ceAbstractionStarter]: At program point L360(lines 360 370) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse5 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= ~r1 (* 256 (div ~r1 256))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse6) (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-10-03 09:14:33,225 INFO L421 ceAbstractionStarter]: At program point L315(lines 315 327) the Hoare annotation is: (let ((.cse0 (<= 0 ~send1)) (.cse1 (<= ~send1 127)) (.cse2 (= 0 (+ ~nomsg 1)))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p1_old ~nomsg)) .cse0 (<= 1 ~mode2) (<= ~mode2 1) .cse1 .cse2))) [2018-10-03 09:14:33,225 INFO L421 ceAbstractionStarter]: At program point L340(lines 340 350) the Hoare annotation is: (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= ~mode2 1)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (<= 0 ~send1)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= ~r1 (* 256 (div ~r1 256))))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 (= ~mode2 (* 256 (div ~mode2 256))) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4))) [2018-10-03 09:14:33,226 INFO L421 ceAbstractionStarter]: At program point L431(lines 431 439) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= 0 ~send1)) (.cse2 (<= 1 ~mode2)) (.cse3 (<= ~mode2 1)) (.cse4 (<= ~send1 127)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((v_~r1_7 Int)) (let ((.cse6 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse6 1)) (<= .cse6 0)))) .cse5))) [2018-10-03 09:14:33,226 INFO L421 ceAbstractionStarter]: At program point L452(lines 452 459) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= 0 ~send1) (= ULTIMATE.start_assert_~arg 1) (<= 1 ~mode2) (<= ~mode2 1) (<= ~send1 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~129)) [2018-10-03 09:14:33,239 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,240 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,243 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,243 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,248 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,248 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,250 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,250 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,255 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,256 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,260 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,261 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,266 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,267 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,268 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,273 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,278 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,278 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,283 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,284 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,291 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,291 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,292 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,293 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,294 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,299 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,300 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,300 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,307 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,308 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,309 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,309 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,312 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,312 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,312 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,313 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,318 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:14:33 BoogieIcfgContainer [2018-10-03 09:14:33,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:14:33,319 INFO L168 Benchmark]: Toolchain (without parser) took 12352.51 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 192.5 MB). Peak memory consumption was 490.5 MB. Max. memory is 7.1 GB. [2018-10-03 09:14:33,320 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:14:33,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:14:33,327 INFO L168 Benchmark]: Boogie Preprocessor took 54.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:14:33,327 INFO L168 Benchmark]: RCFGBuilder took 714.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 09:14:33,329 INFO L168 Benchmark]: TraceAbstraction took 11521.59 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 160.8 MB). Peak memory consumption was 458.8 MB. Max. memory is 7.1 GB. [2018-10-03 09:14:33,338 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.27 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 54.95 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 54.38 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 714.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11521.59 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 37.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 160.8 MB). Peak memory consumption was 458.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] - 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: 463]: 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: 452]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && assert_~arg == 1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~129 - InvariantResult [Line: 349]: Loop Invariant [2018-10-03 09:14:33,355 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,356 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 369]: Loop Invariant [2018-10-03 09:14:33,357 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,358 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 389]: Loop Invariant [2018-10-03 09:14:33,359 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,359 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,360 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,360 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 409]: Loop Invariant [2018-10-03 09:14:33,361 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,361 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,362 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,362 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) || ((((((0 <= ~send1 && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 340]: Loop Invariant [2018-10-03 09:14:33,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,363 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,364 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,364 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 360]: Loop Invariant [2018-10-03 09:14:33,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,367 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || ((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 380]: Loop Invariant [2018-10-03 09:14:33,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,368 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,369 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 400]: Loop Invariant [2018-10-03 09:14:33,373 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,374 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~129 - InvariantResult [Line: 326]: Loop Invariant [2018-10-03 09:14:33,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,375 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,376 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,376 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send1) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && 0 <= ~send1) && !(~p1_new == ~nomsg)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 431]: Loop Invariant [2018-10-03 09:14:33,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,379 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] [2018-10-03 09:14:33,382 WARN L390 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~r1_7,QUANTIFIED] Derived loop invariant: ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || ((((((!(~p1_old == ~nomsg) && 0 <= ~send1) && 1 <= ~mode2) && ~mode2 <= 1) && ~send1 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 == ~nomsg + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 11.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 238 SDslu, 219 SDs, 0 SdLazy, 187 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 325 NumberOfFragments, 1326 HoareAnnotationTreeSize, 15 FomulaSimplifications, 16549 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 248 ConstructedInterpolants, 10 QuantifiedInterpolants, 24394 SizeOfPredicates, 1 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 126/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-14-33-388.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c_11.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-14-33-388.csv Received shutdown request...