java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:40:09,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:40:09,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:40:09,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:40:09,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:40:09,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:40:09,755 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:40:09,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:40:09,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:40:09,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:40:09,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:40:09,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:40:09,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:40:09,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:40:09,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:40:09,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:40:09,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:40:09,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:40:09,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:40:09,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:40:09,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:40:09,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:40:09,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:40:09,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:40:09,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:40:09,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:40:09,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:40:09,782 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:40:09,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:40:09,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:40:09,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:40:09,784 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:40:09,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:40:09,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:40:09,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:40:09,794 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:40:09,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:40:09,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:40:09,794 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:40:09,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:40:09,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:40:09,795 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:40:09,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:40:09,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:40:09,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:40:09,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:40:09,796 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:40:09,797 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:40:09,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:40:09,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:40:09,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:40:09,797 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:40:09,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:40:09,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:40:09,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:40:09,798 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:40:09,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:40:09,798 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:40:09,799 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:40:09,799 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:40:09,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:40:09,844 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:40:09,847 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:40:09,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:40:09,849 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:40:09,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:40:10,033 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:40:10,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:40:10,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:40:10,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:40:10,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:40:10,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10, skipping insertion in model container [2018-01-24 11:40:10,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,062 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:40:10,100 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:40:10,220 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:40:10,237 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:40:10,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10 WrapperNode [2018-01-24 11:40:10,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:40:10,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:40:10,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:40:10,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:40:10,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... [2018-01-24 11:40:10,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:40:10,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:40:10,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:40:10,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:40:10,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:40:10,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:40:10,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:40:10,325 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-24 11:40:10,325 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:40:10,325 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:40:10,325 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:40:10,326 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:40:10,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:40:10,533 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:40:10,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:40:10 BoogieIcfgContainer [2018-01-24 11:40:10,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:40:10,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:40:10,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:40:10,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:40:10,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:40:10" (1/3) ... [2018-01-24 11:40:10,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571951bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:40:10, skipping insertion in model container [2018-01-24 11:40:10,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:10" (2/3) ... [2018-01-24 11:40:10,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571951bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:40:10, skipping insertion in model container [2018-01-24 11:40:10,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:40:10" (3/3) ... [2018-01-24 11:40:10,540 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:40:10,548 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:40:10,554 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 11:40:10,602 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:40:10,602 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:40:10,603 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:40:10,603 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:40:10,603 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:40:10,603 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:40:10,603 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:40:10,603 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:40:10,604 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:40:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-24 11:40:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:40:10,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:10,631 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:10,632 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-01-24 11:40:10,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:10,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:10,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:10,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:10,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:10,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:10,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:10,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:40:10,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:40:10,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:40:10,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:40:10,819 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-01-24 11:40:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:11,005 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-24 11:40:11,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:40:11,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 11:40:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:11,018 INFO L225 Difference]: With dead ends: 56 [2018-01-24 11:40:11,018 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 11:40:11,022 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:40:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 11:40:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 11:40:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:40:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 11:40:11,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-01-24 11:40:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:11,057 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 11:40:11,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:40:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 11:40:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:40:11,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:11,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:11,058 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-01-24 11:40:11,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:11,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:11,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:11,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:11,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:11,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:11,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:40:11,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:40:11,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:40:11,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:40:11,294 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-01-24 11:40:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:11,366 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-01-24 11:40:11,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:40:11,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 11:40:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:11,367 INFO L225 Difference]: With dead ends: 37 [2018-01-24 11:40:11,367 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:40:11,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:40:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:40:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:40:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:40:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-24 11:40:11,374 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-01-24 11:40:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:11,374 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-24 11:40:11,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:40:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-24 11:40:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:40:11,375 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:11,375 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:11,375 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-01-24 11:40:11,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:11,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:11,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:11,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:11,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:11,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:11,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:40:11,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:40:11,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:40:11,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:40:11,427 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-24 11:40:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:11,517 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-01-24 11:40:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:40:11,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 11:40:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:11,518 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:40:11,518 INFO L226 Difference]: Without dead ends: 33 [2018-01-24 11:40:11,519 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:40:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-24 11:40:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-24 11:40:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 11:40:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-24 11:40:11,524 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-01-24 11:40:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:11,524 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-24 11:40:11,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:40:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-24 11:40:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:40:11,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:11,525 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:11,525 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-01-24 11:40:11,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:11,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:11,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:11,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:11,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:11,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:11,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:40:11,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:40:11,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:40:11,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:40:11,624 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-01-24 11:40:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:11,778 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-24 11:40:11,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:40:11,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 11:40:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:11,781 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:40:11,781 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:40:11,782 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:40:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:40:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-24 11:40:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:40:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-24 11:40:11,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-01-24 11:40:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:11,790 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-24 11:40:11,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:40:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-24 11:40:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:40:11,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:11,791 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:11,791 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-01-24 11:40:11,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:11,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:11,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:11,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:11,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:11,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:11,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:40:11,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:40:11,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:40:11,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:40:11,831 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-01-24 11:40:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:11,844 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-24 11:40:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:40:11,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-24 11:40:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:11,846 INFO L225 Difference]: With dead ends: 63 [2018-01-24 11:40:11,846 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 11:40:11,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:40:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 11:40:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 11:40:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 11:40:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 11:40:11,853 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-01-24 11:40:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:11,854 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 11:40:11,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:40:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 11:40:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:40:11,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:11,855 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:11,855 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-01-24 11:40:11,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:11,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:11,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:11,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:11,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:12,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:40:12,115 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:40:12,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:12,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:40:12,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:40:12,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:40:12,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:12,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:12,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:40:12,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:40:12,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 11:40:12,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:40:12,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:40:12,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:40:12,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:40:12,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:40:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:12,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:40:12,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-01-24 11:40:12,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:40:12,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:40:12,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:40:12,501 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 18 states. [2018-01-24 11:40:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:13,134 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 11:40:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:40:13,135 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-24 11:40:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:13,136 INFO L225 Difference]: With dead ends: 68 [2018-01-24 11:40:13,136 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 11:40:13,137 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:40:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 11:40:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-01-24 11:40:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 11:40:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 11:40:13,145 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-01-24 11:40:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:13,145 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 11:40:13,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:40:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 11:40:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 11:40:13,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:13,147 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-24 11:40:13,147 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-01-24 11:40:13,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:13,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:13,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:13,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:13,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:13,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:13,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:13,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:40:13,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:40:13,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:40:13,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:40:13,259 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 11:40:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:13,315 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 11:40:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:40:13,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 11:40:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:13,316 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:40:13,316 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 11:40:13,317 INFO L525 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 [2018-01-24 11:40:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 11:40:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 11:40:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 11:40:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-24 11:40:13,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2018-01-24 11:40:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:13,324 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-24 11:40:13,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:40:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-24 11:40:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:40:13,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:13,326 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:13,326 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 622344746, now seen corresponding path program 2 times [2018-01-24 11:40:13,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:13,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:13,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:13,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:13,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:13,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:13,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:40:13,648 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:40:13,654 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:40:13,664 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:40:13,672 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:40:13,674 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:40:13,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:40:13,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:40:13,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:13,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:13,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:40:13,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:40:13,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:40:13,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:13,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:13,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:13,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 11:40:13,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 11:40:13,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:40:13,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:40:13,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:40:13,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:40:13,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 11:40:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:40:13,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:40:13,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-01-24 11:40:13,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:40:13,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:40:13,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:40:13,969 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-01-24 11:40:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:14,603 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 11:40:14,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:40:14,603 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-24 11:40:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:14,604 INFO L225 Difference]: With dead ends: 40 [2018-01-24 11:40:14,604 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:40:14,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2018-01-24 11:40:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:40:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:40:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:40:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:40:14,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 11:40:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:14,606 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:40:14,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:40:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:40:14,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:40:14,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:40:14,867 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 81 DAG size of output 57 [2018-01-24 11:40:14,918 INFO L401 ceAbstractionStarter]: For program point cstrchrErr3RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,919 INFO L401 ceAbstractionStarter]: For program point cstrchrEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-24 11:40:14,919 INFO L401 ceAbstractionStarter]: For program point L542(lines 542 543) no Hoare annotation was computed. [2018-01-24 11:40:14,919 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 11:40:14,919 INFO L401 ceAbstractionStarter]: For program point cstrchrErr2RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,919 INFO L397 ceAbstractionStarter]: At program point L542''''''''(lines 542 543) the Hoare annotation is: (or (not (= 1 (select |#valid| |cstrchr_#in~s.base|))) (not (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_2) (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 |cstrchr_#in~s.offset|) (= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) (+ v_main_~nondetString~3.offset_BEFORE_CALL_2 (select |#length| |cstrchr_#in~s.base|) (- 1)))) (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 0)))) (not (exists ((main_~length~3 Int) (v_main_~nondetString~3.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~3) (= (select (select |#memory_int| |cstrchr_#in~s.base|) (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1 (- 1))) 0) (<= (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1) (select |#length| |cstrchr_#in~s.base|)) (<= |cstrchr_#in~s.offset| v_main_~nondetString~3.offset_BEFORE_CALL_1)))) (not (= 0 |cstrchr_#in~s.offset|)) (and (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 cstrchr_~s.offset) (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| cstrchr_~s.base) (+ v_main_~nondetString~3.offset_BEFORE_CALL_2 (select |#length| cstrchr_~s.base) (- 1)))) (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 0))) (exists ((main_~length~3 Int) (v_main_~nondetString~3.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1) (select |#length| cstrchr_~s.base)) (<= 1 main_~length~3) (<= cstrchr_~s.offset v_main_~nondetString~3.offset_BEFORE_CALL_1) (= (select (select |#memory_int| cstrchr_~s.base) (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1 (- 1))) 0))) (= 1 (select |#valid| cstrchr_~s.base)))) [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point cstrchrErr5RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point cstrchrFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point cstrchrErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point L542'''''''''(lines 542 543) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point cstrchrErr4RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-24 11:40:14,920 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L404 ceAbstractionStarter]: At program point cstrchrENTRY(lines 540 545) the Hoare annotation is: true [2018-01-24 11:40:14,921 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L401 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L401 ceAbstractionStarter]: For program point cstrchrErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:40:14,921 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,921 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 11:40:14,922 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,922 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 11:40:14,922 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,922 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,922 INFO L397 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ .cse0 main_~nondetString~3.offset (- 1)))) (= 0 |main_#t~malloc7.offset|) (exists ((main_~length~3 Int)) (and (<= 1 main_~length~3) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ main_~nondetString~3.offset main_~length~3 (- 1)))) (<= (+ main_~nondetString~3.offset main_~length~3) (select |#length| main_~nondetString~3.base)))) (= main_~length~3 (select |#length| |main_#t~malloc7.base|)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|) (= main_~nondetString~3.offset 0) (= main_~length~3 .cse0))) [2018-01-24 11:40:14,922 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 11:40:14,922 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 555) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 555) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 555) no Hoare annotation was computed. [2018-01-24 11:40:14,923 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:40:14,923 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-24 11:40:14,924 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 11:40:14,930 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,931 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,946 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,947 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,948 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,950 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:40:14 BoogieIcfgContainer [2018-01-24 11:40:14,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:40:14,956 INFO L168 Benchmark]: Toolchain (without parser) took 4922.25 ms. Allocated memory was 307.8 MB in the beginning and 520.6 MB in the end (delta: 212.9 MB). Free memory was 267.8 MB in the beginning and 408.9 MB in the end (delta: -141.1 MB). Peak memory consumption was 71.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:14,957 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:40:14,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.61 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:14,958 INFO L168 Benchmark]: Boogie Preprocessor took 31.26 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 255.7 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-24 11:40:14,958 INFO L168 Benchmark]: RCFGBuilder took 256.45 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 238.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:14,959 INFO L168 Benchmark]: TraceAbstraction took 4420.18 ms. Allocated memory was 307.8 MB in the beginning and 520.6 MB in the end (delta: 212.9 MB). Free memory was 238.7 MB in the beginning and 408.9 MB in the end (delta: -170.2 MB). Peak memory consumption was 42.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:14,961 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.61 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.26 ms. Allocated memory is still 307.8 MB. Free memory was 256.7 MB in the beginning and 255.7 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 256.45 ms. Allocated memory is still 307.8 MB. Free memory was 255.7 MB in the beginning and 238.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4420.18 ms. Allocated memory was 307.8 MB in the beginning and 520.6 MB in the end (delta: 212.9 MB). Free memory was 238.7 MB in the beginning and 408.9 MB in the end (delta: -170.2 MB). Peak memory consumption was 42.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-24 11:40:14,966 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,967 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,969 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,970 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,973 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:40:14,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 11:40:14,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 11:40:14,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,977 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:14,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,978 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:14,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(1 == \valid[s]) || !(\exists v_main_~nondetString~3.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString~3.offset_BEFORE_CALL_2 && v_main_~nondetString~3.offset_BEFORE_CALL_2 <= s) && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_2 + unknown-#length-unknown[s] + -1]) && v_main_~nondetString~3.offset_BEFORE_CALL_2 <= 0)) || !(\exists main_~length~3 : int, v_main_~nondetString~3.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~3 && unknown-#memory_int-unknown[s][main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 + -1] == 0) && main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s]) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_1)) || !(0 == s)) || (((\exists v_main_~nondetString~3.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~3.offset_BEFORE_CALL_2 <= s && 0 <= v_main_~nondetString~3.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_2 + unknown-#length-unknown[s] + -1]) && v_main_~nondetString~3.offset_BEFORE_CALL_2 <= 0) && (\exists main_~length~3 : int, v_main_~nondetString~3.offset_BEFORE_CALL_1 : int :: ((main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s] && 1 <= main_~length~3) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_1) && unknown-#memory_int-unknown[s][main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 + -1] == 0)) && 1 == \valid[s]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 9 error locations. SAFE Result, 4.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 420 SDslu, 682 SDs, 0 SdLazy, 683 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 191 HoareAnnotationTreeSize, 7 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 446 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 189 ConstructedInterpolants, 15 QuantifiedInterpolants, 36713 SizeOfPredicates, 14 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-40-14-984.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-40-14-984.csv Received shutdown request...