/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:11:11,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:11:11,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:11:11,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:11:11,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:11:11,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:11:11,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:11:11,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:11:11,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:11:11,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:11:11,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:11:11,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:11:11,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:11:11,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:11:11,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:11:11,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:11:11,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:11:11,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:11:11,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:11:11,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:11:11,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:11:11,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:11:11,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:11:11,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:11:11,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:11:11,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:11:11,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:11:11,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:11:11,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:11:11,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:11:11,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:11:11,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:11:11,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:11:11,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:11:11,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:11:11,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:11:11,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:11:11,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:11:11,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:11:11,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:11:11,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:11:11,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:11:11,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:11:11,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:11:11,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:11:11,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:11:11,522 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:11:11,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:11:11,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:11:11,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:11:11,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:11:11,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:11:11,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:11:11,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:11:11,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:11:11,526 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:11:11,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:11:11,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:11:11,527 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:11:11,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:11:11,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:11:11,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:11:11,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:11:11,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:11:11,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:11:11,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:11:11,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:11:11,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:11:11,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:11:11,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:11:11,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:11:11,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:11:11,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:11:11,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:11:11,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:11:11,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:11:11,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:11:11,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-11-23 22:11:11,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f43acd78/e100534d82e14536b337bb513a6ba23e/FLAGe1c008635 [2019-11-23 22:11:12,418 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:11:12,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-11-23 22:11:12,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f43acd78/e100534d82e14536b337bb513a6ba23e/FLAGe1c008635 [2019-11-23 22:11:12,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f43acd78/e100534d82e14536b337bb513a6ba23e [2019-11-23 22:11:12,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:11:12,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:11:12,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:11:12,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:11:12,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:11:12,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:11:12" (1/1) ... [2019-11-23 22:11:12,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf34412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:12, skipping insertion in model container [2019-11-23 22:11:12,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:11:12" (1/1) ... [2019-11-23 22:11:12,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:11:12,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:11:12,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:11:12,983 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:11:13,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:11:13,015 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:11:13,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13 WrapperNode [2019-11-23 22:11:13,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:11:13,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:11:13,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:11:13,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:11:13,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:11:13,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:11:13,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:11:13,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:11:13,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (1/1) ... [2019-11-23 22:11:13,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:11:13,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:11:13,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:11:13,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:11:13,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (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 [2019-11-23 22:11:13,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:11:13,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:11:13,578 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:11:13,578 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-23 22:11:13,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:11:13 BoogieIcfgContainer [2019-11-23 22:11:13,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:11:13,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:11:13,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:11:13,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:11:13,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:11:12" (1/3) ... [2019-11-23 22:11:13,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba027f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:11:13, skipping insertion in model container [2019-11-23 22:11:13,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:11:13" (2/3) ... [2019-11-23 22:11:13,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba027f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:11:13, skipping insertion in model container [2019-11-23 22:11:13,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:11:13" (3/3) ... [2019-11-23 22:11:13,588 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-11-23 22:11:13,602 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:11:13,609 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-23 22:11:13,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-23 22:11:13,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:11:13,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:11:13,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:11:13,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:11:13,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:11:13,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:11:13,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:11:13,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:11:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-23 22:11:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 22:11:13,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:13,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:13,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1436471502, now seen corresponding path program 1 times [2019-11-23 22:11:13,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:13,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009066655] [2019-11-23 22:11:13,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:13,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009066655] [2019-11-23 22:11:13,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:11:13,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:11:13,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620708448] [2019-11-23 22:11:13,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:11:13,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:11:13,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:11:13,831 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-11-23 22:11:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:13,851 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-11-23 22:11:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:11:13,853 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 22:11:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:13,863 INFO L225 Difference]: With dead ends: 85 [2019-11-23 22:11:13,863 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 22:11:13,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:11:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 22:11:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-23 22:11:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 22:11:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-23 22:11:13,903 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 9 [2019-11-23 22:11:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:13,904 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-23 22:11:13,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:11:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-23 22:11:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:11:13,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:13,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:13,905 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1526631753, now seen corresponding path program 1 times [2019-11-23 22:11:13,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:13,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633790462] [2019-11-23 22:11:13,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:13,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633790462] [2019-11-23 22:11:13,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:11:13,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:11:13,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49358685] [2019-11-23 22:11:13,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:11:13,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:11:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:11:13,977 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-11-23 22:11:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:14,083 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-23 22:11:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:11:14,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-23 22:11:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:14,085 INFO L225 Difference]: With dead ends: 44 [2019-11-23 22:11:14,085 INFO L226 Difference]: Without dead ends: 38 [2019-11-23 22:11:14,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:11:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-23 22:11:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-11-23 22:11:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 22:11:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-23 22:11:14,097 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2019-11-23 22:11:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:14,097 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-23 22:11:14,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:11:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-23 22:11:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:11:14,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:14,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:14,101 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1785542740, now seen corresponding path program 1 times [2019-11-23 22:11:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:14,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461355468] [2019-11-23 22:11:14,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:14,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461355468] [2019-11-23 22:11:14,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:11:14,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:11:14,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653359292] [2019-11-23 22:11:14,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:11:14,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:11:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:11:14,192 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2019-11-23 22:11:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:14,328 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-23 22:11:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:11:14,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-23 22:11:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:14,330 INFO L225 Difference]: With dead ends: 50 [2019-11-23 22:11:14,330 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 22:11:14,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:11:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 22:11:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-11-23 22:11:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 22:11:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-23 22:11:14,341 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2019-11-23 22:11:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:14,342 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-23 22:11:14,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:11:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-23 22:11:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:11:14,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:14,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:14,344 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash -734801565, now seen corresponding path program 1 times [2019-11-23 22:11:14,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:14,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742780285] [2019-11-23 22:11:14,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:14,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742780285] [2019-11-23 22:11:14,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:11:14,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:11:14,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643726738] [2019-11-23 22:11:14,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:11:14,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:14,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:11:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:11:14,389 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-23 22:11:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:14,473 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-23 22:11:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:11:14,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-23 22:11:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:14,475 INFO L225 Difference]: With dead ends: 44 [2019-11-23 22:11:14,475 INFO L226 Difference]: Without dead ends: 42 [2019-11-23 22:11:14,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:11:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-23 22:11:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-23 22:11:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 22:11:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-23 22:11:14,488 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-11-23 22:11:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:14,489 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-23 22:11:14,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:11:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-23 22:11:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:11:14,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:14,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:14,491 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:14,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:14,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2090765742, now seen corresponding path program 1 times [2019-11-23 22:11:14,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:14,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041206017] [2019-11-23 22:11:14,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:14,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041206017] [2019-11-23 22:11:14,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:11:14,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:11:14,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302228130] [2019-11-23 22:11:14,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:11:14,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:11:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:11:14,574 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2019-11-23 22:11:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:14,756 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-23 22:11:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:11:14,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 22:11:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:14,758 INFO L225 Difference]: With dead ends: 71 [2019-11-23 22:11:14,758 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 22:11:14,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:11:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 22:11:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-23 22:11:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 22:11:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-23 22:11:14,767 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-11-23 22:11:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:14,768 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-23 22:11:14,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:11:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-23 22:11:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:11:14,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:14,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:14,770 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1769510362, now seen corresponding path program 1 times [2019-11-23 22:11:14,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:14,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727461341] [2019-11-23 22:11:14,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:14,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727461341] [2019-11-23 22:11:14,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:11:14,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:11:14,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895202562] [2019-11-23 22:11:14,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:11:14,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:11:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:11:14,848 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2019-11-23 22:11:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:15,016 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-23 22:11:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:11:15,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-23 22:11:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:15,017 INFO L225 Difference]: With dead ends: 63 [2019-11-23 22:11:15,018 INFO L226 Difference]: Without dead ends: 61 [2019-11-23 22:11:15,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:11:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-23 22:11:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-23 22:11:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 22:11:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-23 22:11:15,026 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 17 [2019-11-23 22:11:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:15,026 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-23 22:11:15,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:11:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-23 22:11:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:11:15,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:15,028 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:15,028 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1110583474, now seen corresponding path program 1 times [2019-11-23 22:11:15,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:15,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128921834] [2019-11-23 22:11:15,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:15,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128921834] [2019-11-23 22:11:15,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996375118] [2019-11-23 22:11:15,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:15,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-23 22:11:15,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:11:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:15,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:11:15,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-23 22:11:15,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876752854] [2019-11-23 22:11:15,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 22:11:15,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 22:11:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:11:15,430 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 14 states. [2019-11-23 22:11:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:16,359 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-23 22:11:16,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-23 22:11:16,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-23 22:11:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:16,362 INFO L225 Difference]: With dead ends: 121 [2019-11-23 22:11:16,362 INFO L226 Difference]: Without dead ends: 94 [2019-11-23 22:11:16,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=1042, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:11:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-23 22:11:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2019-11-23 22:11:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 22:11:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-23 22:11:16,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-11-23 22:11:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:16,373 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-23 22:11:16,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 22:11:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-23 22:11:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:11:16,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:16,375 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:16,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:16,580 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1311932474, now seen corresponding path program 1 times [2019-11-23 22:11:16,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:16,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139138273] [2019-11-23 22:11:16,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:16,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139138273] [2019-11-23 22:11:16,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590885093] [2019-11-23 22:11:16,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:16,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 22:11:16,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:11:16,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:16,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:11:16,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-23 22:11:16,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877876571] [2019-11-23 22:11:16,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:11:16,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:11:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:11:16,768 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2019-11-23 22:11:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:16,943 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-23 22:11:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:11:16,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-23 22:11:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:16,945 INFO L225 Difference]: With dead ends: 77 [2019-11-23 22:11:16,945 INFO L226 Difference]: Without dead ends: 75 [2019-11-23 22:11:16,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:11:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-23 22:11:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-23 22:11:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 22:11:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-23 22:11:16,954 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 28 [2019-11-23 22:11:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:16,954 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-23 22:11:16,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:11:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-23 22:11:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:11:16,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:16,955 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:17,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:17,168 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1348445734, now seen corresponding path program 2 times [2019-11-23 22:11:17,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:17,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876077595] [2019-11-23 22:11:17,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:17,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876077595] [2019-11-23 22:11:17,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939355128] [2019-11-23 22:11:17,390 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:17,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:11:17,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:11:17,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 22:11:17,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:11:17,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:17,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:17,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:17,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:11:17,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-11-23 22:11:17,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559612291] [2019-11-23 22:11:17,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 22:11:17,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 22:11:17,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:11:17,666 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 22 states. [2019-11-23 22:11:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:18,843 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-11-23 22:11:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 22:11:18,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-11-23 22:11:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:18,845 INFO L225 Difference]: With dead ends: 99 [2019-11-23 22:11:18,845 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 22:11:18,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=1476, Unknown=0, NotChecked=0, Total=1806 [2019-11-23 22:11:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 22:11:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2019-11-23 22:11:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 22:11:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-23 22:11:18,856 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 39 [2019-11-23 22:11:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:18,856 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-23 22:11:18,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 22:11:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-23 22:11:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:11:18,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:18,858 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:19,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:19,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash 670000306, now seen corresponding path program 2 times [2019-11-23 22:11:19,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:19,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068458178] [2019-11-23 22:11:19,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 22:11:19,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068458178] [2019-11-23 22:11:19,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899259425] [2019-11-23 22:11:19,216 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:19,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 22:11:19,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:11:19,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 22:11:19,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:11:19,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:19,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:11:19,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-11-23 22:11:19,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844119622] [2019-11-23 22:11:19,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:11:19,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:11:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:11:19,479 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 19 states. [2019-11-23 22:11:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:20,117 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-23 22:11:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:11:20,117 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-11-23 22:11:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:20,118 INFO L225 Difference]: With dead ends: 75 [2019-11-23 22:11:20,118 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 22:11:20,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:11:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 22:11:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-11-23 22:11:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 22:11:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-23 22:11:20,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-11-23 22:11:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:20,141 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-23 22:11:20,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:11:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-23 22:11:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:11:20,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:11:20,143 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:11:20,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:20,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:11:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:11:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2085108794, now seen corresponding path program 3 times [2019-11-23 22:11:20,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:11:20,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154754767] [2019-11-23 22:11:20,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:11:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:11:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 22:11:20,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154754767] [2019-11-23 22:11:20,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869783325] [2019-11-23 22:11:20,543 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:20,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 22:11:20,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:11:20,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 22:11:20,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:11:20,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:20,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:20,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:11:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:11:20,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:11:20,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-11-23 22:11:20,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046661436] [2019-11-23 22:11:20,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 22:11:20,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:11:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 22:11:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:11:20,904 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 25 states. [2019-11-23 22:11:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:11:22,926 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-23 22:11:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-23 22:11:22,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-11-23 22:11:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:11:22,927 INFO L225 Difference]: With dead ends: 70 [2019-11-23 22:11:22,927 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:11:22,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2019-11-23 22:11:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:11:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:11:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:11:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:11:22,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-23 22:11:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:11:22,932 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:11:22,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 22:11:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:11:22,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:11:23,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:11:23,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:11:23,576 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-11-23 22:11:23,796 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-11-23 22:11:23,988 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-23 22:11:24,239 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-11-23 22:11:24,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,243 INFO L444 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-23 22:11:24,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:11:24,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:11:24,243 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,244 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3))) [2019-11-23 22:11:24,244 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,244 INFO L440 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3))) [2019-11-23 22:11:24,244 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,245 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse0 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse1 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse0 .cse1) (and (<= ULTIMATE.start_main_~buf~0 1) .cse2 .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse0 .cse1) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse2 .cse3 .cse0 .cse1))) [2019-11-23 22:11:24,245 INFO L444 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,245 INFO L440 ceAbstractionStarter]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse1 .cse2 .cse3))) [2019-11-23 22:11:24,245 INFO L444 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,245 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,246 INFO L440 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-23 22:11:24,246 INFO L444 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,246 INFO L440 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-23 22:11:24,246 INFO L444 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,246 INFO L440 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-23 22:11:24,246 INFO L444 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-23 22:11:24,246 INFO L447 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,247 INFO L444 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L444 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,248 INFO L447 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-11-23 22:11:24,249 INFO L447 ceAbstractionStarter]: At program point L41-1(lines 10 42) the Hoare annotation is: true [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-23 22:11:24,249 INFO L444 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-11-23 22:11:24,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:11:24 BoogieIcfgContainer [2019-11-23 22:11:24,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:11:24,275 INFO L168 Benchmark]: Toolchain (without parser) took 11526.24 ms. Allocated memory was 144.7 MB in the beginning and 316.1 MB in the end (delta: 171.4 MB). Free memory was 101.5 MB in the beginning and 283.2 MB in the end (delta: -181.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,276 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.61 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 91.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.34 ms. Allocated memory is still 144.7 MB. Free memory was 91.5 MB in the beginning and 89.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,279 INFO L168 Benchmark]: Boogie Preprocessor took 119.06 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 89.8 MB in the beginning and 180.4 MB in the end (delta: -90.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,280 INFO L168 Benchmark]: RCFGBuilder took 411.92 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 164.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,281 INFO L168 Benchmark]: TraceAbstraction took 10692.79 ms. Allocated memory was 202.4 MB in the beginning and 316.1 MB in the end (delta: 113.8 MB). Free memory was 164.0 MB in the beginning and 283.2 MB in the end (delta: -119.2 MB). Peak memory consumption was 184.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:11:24,285 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.61 ms. Allocated memory is still 144.7 MB. Free memory was 101.3 MB in the beginning and 91.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.34 ms. Allocated memory is still 144.7 MB. Free memory was 91.5 MB in the beginning and 89.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.06 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 89.8 MB in the beginning and 180.4 MB in the end (delta: -90.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.92 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 164.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10692.79 ms. Allocated memory was 202.4 MB in the beginning and 316.1 MB in the end (delta: 113.8 MB). Free memory was 164.0 MB in the beginning and 283.2 MB in the end (delta: -119.2 MB). Peak memory consumption was 184.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && 0 == buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf < buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim)) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((3 <= buf && bufferlen + 1 <= inlen) && !(0 == cond)) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf <= buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && 0 == buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf < buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim)) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf <= buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim)) || ((((in == 0 && 0 == buf) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 8 error locations. Result: SAFE, OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 329 SDtfs, 1146 SDslu, 1123 SDs, 0 SdLazy, 1556 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 51 NumberOfFragments, 423 HoareAnnotationTreeSize, 10 FomulaSimplifications, 8352 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1014 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 449 ConstructedInterpolants, 0 QuantifiedInterpolants, 122483 SizeOfPredicates, 41 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 41/302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...