java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:15:08,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:15:08,755 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:15:08,768 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:15:08,768 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:15:08,769 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:15:08,771 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:15:08,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:15:08,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:15:08,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:15:08,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:15:08,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:15:08,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:15:08,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:15:08,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:15:08,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:15:08,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:15:08,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:15:08,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:15:08,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:15:08,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:15:08,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:15:08,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:15:08,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:15:08,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:15:08,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:15:08,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:15:08,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:15:08,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:15:08,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:15:08,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:15:08,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:15:08,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:15:08,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:15:08,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:15:08,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:15:08,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:15:08,817 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:15:08,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:15:08,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:15:08,819 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:15:08,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:15:08,819 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:15:08,820 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:15:08,820 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:15:08,820 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:15:08,820 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:15:08,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:15:08,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:15:08,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:15:08,821 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:15:08,821 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:15:08,821 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:15:08,822 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:15:08,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:15:08,822 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:15:08,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:15:08,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:15:08,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:15:08,823 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:15:08,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:15:08,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:15:08,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:15:08,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:15:08,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:15:08,824 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:15:08,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:15:08,824 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:15:08,824 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:15:08,825 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:15:08,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:15:08,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:15:08,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:15:08,904 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:15:08,904 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:15:08,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-18 22:15:08,965 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6fc18a31/dddd1d41f7c84fc28e9ff678185ef8ee/FLAG17ea7a35d [2018-11-18 22:15:09,459 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:15:09,460 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-18 22:15:09,469 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6fc18a31/dddd1d41f7c84fc28e9ff678185ef8ee/FLAG17ea7a35d [2018-11-18 22:15:09,798 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6fc18a31/dddd1d41f7c84fc28e9ff678185ef8ee [2018-11-18 22:15:09,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:15:09,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:15:09,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:15:09,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:15:09,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:15:09,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:15:09" (1/1) ... [2018-11-18 22:15:09,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bcf120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:09, skipping insertion in model container [2018-11-18 22:15:09,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:15:09" (1/1) ... [2018-11-18 22:15:09,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:15:09,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:15:10,169 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:15:10,183 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:15:10,256 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:15:10,287 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:15:10,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10 WrapperNode [2018-11-18 22:15:10,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:15:10,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:15:10,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:15:10,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:15:10,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... [2018-11-18 22:15:10,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:15:10,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:15:10,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:15:10,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:15:10,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:15:10,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:15:10,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:15:10,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:15:10,481 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-18 22:15:10,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:15:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:15:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:15:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2018-11-18 22:15:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2018-11-18 22:15:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2018-11-18 22:15:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-11-18 22:15:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2018-11-18 22:15:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2018-11-18 22:15:10,482 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2018-11-18 22:15:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2018-11-18 22:15:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2018-11-18 22:15:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2018-11-18 22:15:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-18 22:15:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2018-11-18 22:15:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2018-11-18 22:15:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2018-11-18 22:15:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2018-11-18 22:15:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2018-11-18 22:15:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2018-11-18 22:15:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2018-11-18 22:15:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2018-11-18 22:15:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2018-11-18 22:15:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-18 22:15:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2018-11-18 22:15:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2018-11-18 22:15:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2018-11-18 22:15:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2018-11-18 22:15:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-18 22:15:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:15:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:15:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 22:15:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 22:15:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:15:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:15:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:15:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 22:15:11,511 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:15:11,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:11 BoogieIcfgContainer [2018-11-18 22:15:11,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:15:11,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:15:11,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:15:11,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:15:11,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:15:09" (1/3) ... [2018-11-18 22:15:11,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c06b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:15:11, skipping insertion in model container [2018-11-18 22:15:11,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:10" (2/3) ... [2018-11-18 22:15:11,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c06b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:15:11, skipping insertion in model container [2018-11-18 22:15:11,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:11" (3/3) ... [2018-11-18 22:15:11,520 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-18 22:15:11,530 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:15:11,539 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:15:11,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:15:11,594 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:15:11,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:15:11,595 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:15:11,595 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:15:11,595 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:15:11,595 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:15:11,595 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:15:11,596 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:15:11,596 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:15:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-18 22:15:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 22:15:11,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:11,623 INFO L375 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] [2018-11-18 22:15:11,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:11,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash 565940665, now seen corresponding path program 1 times [2018-11-18 22:15:11,637 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:11,638 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:11,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:11,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:11,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {51#true} is VALID [2018-11-18 22:15:11,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {51#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {51#true} is VALID [2018-11-18 22:15:11,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2018-11-18 22:15:11,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #129#return; {51#true} is VALID [2018-11-18 22:15:11,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret20 := main(); {51#true} is VALID [2018-11-18 22:15:11,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {51#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {51#true} is VALID [2018-11-18 22:15:11,836 INFO L256 TraceCheckUtils]: 6: Hoare triple {51#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {51#true} is VALID [2018-11-18 22:15:11,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {51#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {51#true} is VALID [2018-11-18 22:15:11,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {51#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {51#true} is VALID [2018-11-18 22:15:11,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {51#true} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {51#true} is VALID [2018-11-18 22:15:11,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {51#true} assume #t~switch3; {51#true} is VALID [2018-11-18 22:15:11,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {51#true} assume !true; {52#false} is VALID [2018-11-18 22:15:11,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {52#false} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {52#false} is VALID [2018-11-18 22:15:11,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {52#false} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {52#false} is VALID [2018-11-18 22:15:11,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {52#false} ~j~0 := ~bvsub32(~i~0, 1bv32); {52#false} is VALID [2018-11-18 22:15:11,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {52#false} assume !true; {52#false} is VALID [2018-11-18 22:15:11,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {52#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {52#false} is VALID [2018-11-18 22:15:11,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {52#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {52#false} is VALID [2018-11-18 22:15:11,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {52#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {52#false} is VALID [2018-11-18 22:15:11,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {52#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {52#false} is VALID [2018-11-18 22:15:11,854 INFO L256 TraceCheckUtils]: 20: Hoare triple {52#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {52#false} is VALID [2018-11-18 22:15:11,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {52#false} ~cond := #in~cond; {52#false} is VALID [2018-11-18 22:15:11,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {52#false} assume 0bv32 == ~cond; {52#false} is VALID [2018-11-18 22:15:11,855 INFO L273 TraceCheckUtils]: 23: Hoare triple {52#false} assume !false; {52#false} is VALID [2018-11-18 22:15:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:11,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:11,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:15:11,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-18 22:15:11,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:11,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:15:12,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:12,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:15:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:15:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:15:12,070 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-11-18 22:15:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:12,250 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2018-11-18 22:15:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:15:12,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-18 22:15:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:15:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-18 22:15:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:15:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-18 22:15:12,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-18 22:15:13,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:13,238 INFO L225 Difference]: With dead ends: 87 [2018-11-18 22:15:13,239 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 22:15:13,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:15:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 22:15:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-18 22:15:13,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:13,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-18 22:15:13,291 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-18 22:15:13,292 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-18 22:15:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:13,297 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-18 22:15:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-18 22:15:13,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:13,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:13,298 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-18 22:15:13,299 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-18 22:15:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:13,304 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-18 22:15:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-18 22:15:13,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:13,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:13,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:13,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:15:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-11-18 22:15:13,311 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 24 [2018-11-18 22:15:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:13,312 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-18 22:15:13,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:15:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-18 22:15:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:15:13,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:13,314 INFO L375 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, 1, 1, 1] [2018-11-18 22:15:13,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:13,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1249082240, now seen corresponding path program 1 times [2018-11-18 22:15:13,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:13,316 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:13,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:13,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:13,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2018-11-18 22:15:13,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {358#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {358#true} is VALID [2018-11-18 22:15:13,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {358#true} assume true; {358#true} is VALID [2018-11-18 22:15:13,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {358#true} {358#true} #129#return; {358#true} is VALID [2018-11-18 22:15:13,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {358#true} call #t~ret20 := main(); {358#true} is VALID [2018-11-18 22:15:13,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {358#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {358#true} is VALID [2018-11-18 22:15:13,505 INFO L256 TraceCheckUtils]: 6: Hoare triple {358#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {358#true} is VALID [2018-11-18 22:15:13,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {358#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {358#true} is VALID [2018-11-18 22:15:13,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {358#true} is VALID [2018-11-18 22:15:13,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#true} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {358#true} is VALID [2018-11-18 22:15:13,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#true} assume #t~switch3; {358#true} is VALID [2018-11-18 22:15:13,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#true} assume true; {358#true} is VALID [2018-11-18 22:15:13,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {358#true} is VALID [2018-11-18 22:15:13,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#true} assume #t~short6; {402#|parse_expression_list_#t~short6|} is VALID [2018-11-18 22:15:13,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#|parse_expression_list_#t~short6|} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {359#false} is VALID [2018-11-18 22:15:13,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {359#false} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {359#false} is VALID [2018-11-18 22:15:13,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {359#false} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {359#false} is VALID [2018-11-18 22:15:13,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {359#false} ~j~0 := ~bvsub32(~i~0, 1bv32); {359#false} is VALID [2018-11-18 22:15:13,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {359#false} assume true; {359#false} is VALID [2018-11-18 22:15:13,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {359#false} #t~short13 := ~bvslt32(0bv32, ~j~0); {359#false} is VALID [2018-11-18 22:15:13,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {359#false} assume !#t~short13; {359#false} is VALID [2018-11-18 22:15:13,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {359#false} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {359#false} is VALID [2018-11-18 22:15:13,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {359#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {359#false} is VALID [2018-11-18 22:15:13,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {359#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {359#false} is VALID [2018-11-18 22:15:13,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {359#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {359#false} is VALID [2018-11-18 22:15:13,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {359#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {359#false} is VALID [2018-11-18 22:15:13,512 INFO L256 TraceCheckUtils]: 26: Hoare triple {359#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {359#false} is VALID [2018-11-18 22:15:13,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {359#false} ~cond := #in~cond; {359#false} is VALID [2018-11-18 22:15:13,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {359#false} assume 0bv32 == ~cond; {359#false} is VALID [2018-11-18 22:15:13,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {359#false} assume !false; {359#false} is VALID [2018-11-18 22:15:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:13,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:13,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:13,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:15:13,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 22:15:13,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:13,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:15:13,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:13,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:15:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:15:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:15:13,741 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 3 states. [2018-11-18 22:15:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:14,074 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2018-11-18 22:15:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:15:14,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 22:15:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:15:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-18 22:15:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:15:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-18 22:15:14,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2018-11-18 22:15:14,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:14,525 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:15:14,526 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 22:15:14,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-11-18 22:15:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 22:15:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-18 22:15:14,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:14,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-18 22:15:14,542 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-18 22:15:14,542 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-18 22:15:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:14,546 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-18 22:15:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-18 22:15:14,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:14,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:14,547 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-18 22:15:14,548 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-18 22:15:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:14,551 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-18 22:15:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-18 22:15:14,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:14,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:14,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:14,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:15:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-18 22:15:14,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 30 [2018-11-18 22:15:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:14,556 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 22:15:14,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:15:14,556 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-18 22:15:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:15:14,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:14,557 INFO L375 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, 1, 1, 1] [2018-11-18 22:15:14,558 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:14,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1457537154, now seen corresponding path program 1 times [2018-11-18 22:15:14,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:14,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:14,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:14,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:14,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {672#true} call ULTIMATE.init(); {672#true} is VALID [2018-11-18 22:15:14,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {672#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {672#true} is VALID [2018-11-18 22:15:14,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {672#true} assume true; {672#true} is VALID [2018-11-18 22:15:14,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {672#true} {672#true} #129#return; {672#true} is VALID [2018-11-18 22:15:14,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {672#true} call #t~ret20 := main(); {672#true} is VALID [2018-11-18 22:15:14,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {672#true} is VALID [2018-11-18 22:15:14,789 INFO L256 TraceCheckUtils]: 6: Hoare triple {672#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {672#true} is VALID [2018-11-18 22:15:14,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {672#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {672#true} is VALID [2018-11-18 22:15:14,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {672#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {672#true} is VALID [2018-11-18 22:15:14,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {672#true} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {672#true} is VALID [2018-11-18 22:15:14,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#true} assume #t~switch3; {672#true} is VALID [2018-11-18 22:15:14,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#true} assume true; {672#true} is VALID [2018-11-18 22:15:14,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {672#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {672#true} is VALID [2018-11-18 22:15:14,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {672#true} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {672#true} is VALID [2018-11-18 22:15:14,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {672#true} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {672#true} is VALID [2018-11-18 22:15:14,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {672#true} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {672#true} is VALID [2018-11-18 22:15:14,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {672#true} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {672#true} is VALID [2018-11-18 22:15:14,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {672#true} ~j~0 := ~bvsub32(~i~0, 1bv32); {672#true} is VALID [2018-11-18 22:15:14,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {672#true} assume true; {672#true} is VALID [2018-11-18 22:15:14,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {672#true} #t~short13 := ~bvslt32(0bv32, ~j~0); {734#(or (and |parse_expression_list_#t~short13| (bvslt (_ bv0 32) parse_expression_list_~j~0)) (and (not |parse_expression_list_#t~short13|) (not (bvslt (_ bv0 32) parse_expression_list_~j~0))))} is VALID [2018-11-18 22:15:14,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {734#(or (and |parse_expression_list_#t~short13| (bvslt (_ bv0 32) parse_expression_list_~j~0)) (and (not |parse_expression_list_#t~short13|) (not (bvslt (_ bv0 32) parse_expression_list_~j~0))))} assume !#t~short13; {738#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:14,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {738#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {738#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:14,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {738#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {745#(not |parse_expression_list_#t~short16|)} is VALID [2018-11-18 22:15:14,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {745#(not |parse_expression_list_#t~short16|)} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {673#false} is VALID [2018-11-18 22:15:14,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {673#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {673#false} is VALID [2018-11-18 22:15:14,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {673#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {673#false} is VALID [2018-11-18 22:15:14,809 INFO L256 TraceCheckUtils]: 26: Hoare triple {673#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {673#false} is VALID [2018-11-18 22:15:14,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {673#false} ~cond := #in~cond; {673#false} is VALID [2018-11-18 22:15:14,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {673#false} assume 0bv32 == ~cond; {673#false} is VALID [2018-11-18 22:15:14,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {673#false} assume !false; {673#false} is VALID [2018-11-18 22:15:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:14,812 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:14,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:14,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:15:14,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-18 22:15:14,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:14,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:15:14,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:14,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:15:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:15:14,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:15:14,936 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 5 states. [2018-11-18 22:15:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:15,661 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2018-11-18 22:15:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:15:15,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-18 22:15:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:15:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2018-11-18 22:15:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:15:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2018-11-18 22:15:15,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 119 transitions. [2018-11-18 22:15:15,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:15,886 INFO L225 Difference]: With dead ends: 95 [2018-11-18 22:15:15,886 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 22:15:15,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:15:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 22:15:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2018-11-18 22:15:15,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:15,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 45 states. [2018-11-18 22:15:15,919 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 45 states. [2018-11-18 22:15:15,919 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 45 states. [2018-11-18 22:15:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:15,924 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-11-18 22:15:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-11-18 22:15:15,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:15,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:15,926 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 63 states. [2018-11-18 22:15:15,926 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 63 states. [2018-11-18 22:15:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:15,930 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-11-18 22:15:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-11-18 22:15:15,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:15,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:15,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:15,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:15:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-18 22:15:15,934 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 30 [2018-11-18 22:15:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:15,934 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-18 22:15:15,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:15:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-18 22:15:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:15:15,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:15,936 INFO L375 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, 1, 1, 1] [2018-11-18 22:15:15,936 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:15,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1005164478, now seen corresponding path program 1 times [2018-11-18 22:15:15,937 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:15,937 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:16,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:16,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2018-11-18 22:15:16,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1066#true} is VALID [2018-11-18 22:15:16,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2018-11-18 22:15:16,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #129#return; {1066#true} is VALID [2018-11-18 22:15:16,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret20 := main(); {1066#true} is VALID [2018-11-18 22:15:16,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {1066#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {1066#true} is VALID [2018-11-18 22:15:16,314 INFO L256 TraceCheckUtils]: 6: Hoare triple {1066#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1066#true} is VALID [2018-11-18 22:15:16,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {1066#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {1092#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {1092#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {1092#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {1092#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true; {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:16,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {1099#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1121#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:16,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {1121#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume true; {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short13 := ~bvslt32(0bv32, ~j~0); {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13; {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short16 := ~bvslt32(0bv32, ~j~0); {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16; {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:16,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {1125#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {1067#false} is VALID [2018-11-18 22:15:16,342 INFO L256 TraceCheckUtils]: 26: Hoare triple {1067#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {1067#false} is VALID [2018-11-18 22:15:16,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2018-11-18 22:15:16,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {1067#false} assume 0bv32 == ~cond; {1067#false} is VALID [2018-11-18 22:15:16,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2018-11-18 22:15:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:16,348 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:15:16,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 22:15:16,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:16,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:15:16,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:16,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:15:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:15:16,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:15:16,414 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 6 states. [2018-11-18 22:15:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:17,554 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2018-11-18 22:15:17,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:15:17,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 22:15:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:15:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2018-11-18 22:15:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:15:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2018-11-18 22:15:17,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 173 transitions. [2018-11-18 22:15:17,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:17,957 INFO L225 Difference]: With dead ends: 155 [2018-11-18 22:15:17,957 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 22:15:17,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:15:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 22:15:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2018-11-18 22:15:18,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:18,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 70 states. [2018-11-18 22:15:18,045 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 70 states. [2018-11-18 22:15:18,045 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 70 states. [2018-11-18 22:15:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:18,051 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-18 22:15:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2018-11-18 22:15:18,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:18,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:18,053 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 114 states. [2018-11-18 22:15:18,053 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 114 states. [2018-11-18 22:15:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:18,059 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-18 22:15:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2018-11-18 22:15:18,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:18,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:18,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:18,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 22:15:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-18 22:15:18,064 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 30 [2018-11-18 22:15:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:18,065 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-18 22:15:18,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:15:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-18 22:15:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 22:15:18,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:18,066 INFO L375 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, 1, 1, 1] [2018-11-18 22:15:18,066 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2016281728, now seen corresponding path program 1 times [2018-11-18 22:15:18,067 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:18,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:18,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2018-11-18 22:15:18,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {1657#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1657#true} is VALID [2018-11-18 22:15:18,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-18 22:15:18,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1657#true} {1657#true} #129#return; {1657#true} is VALID [2018-11-18 22:15:18,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {1657#true} call #t~ret20 := main(); {1657#true} is VALID [2018-11-18 22:15:18,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {1657#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {1657#true} is VALID [2018-11-18 22:15:18,272 INFO L256 TraceCheckUtils]: 6: Hoare triple {1657#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1657#true} is VALID [2018-11-18 22:15:18,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {1657#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {1683#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {1683#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {1683#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {1683#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true; {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:18,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {1690#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} ~j~0 := ~bvsub32(~i~0, 1bv32); {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume true; {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short13 := ~bvslt32(0bv32, ~j~0); {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13; {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short16 := ~bvslt32(0bv32, ~j~0); {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16; {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:18,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {1715#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {1658#false} is VALID [2018-11-18 22:15:18,311 INFO L256 TraceCheckUtils]: 26: Hoare triple {1658#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {1658#false} is VALID [2018-11-18 22:15:18,312 INFO L273 TraceCheckUtils]: 27: Hoare triple {1658#false} ~cond := #in~cond; {1658#false} is VALID [2018-11-18 22:15:18,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {1658#false} assume 0bv32 == ~cond; {1658#false} is VALID [2018-11-18 22:15:18,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2018-11-18 22:15:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:18,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:15:18,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:18,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:15:18,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-18 22:15:18,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:18,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:15:18,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:18,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:15:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:15:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:15:18,361 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 5 states. [2018-11-18 22:15:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:19,202 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2018-11-18 22:15:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:15:19,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-18 22:15:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:15:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2018-11-18 22:15:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:15:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2018-11-18 22:15:19,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 156 transitions. [2018-11-18 22:15:19,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:19,548 INFO L225 Difference]: With dead ends: 155 [2018-11-18 22:15:19,549 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 22:15:19,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:15:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 22:15:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2018-11-18 22:15:19,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:19,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 70 states. [2018-11-18 22:15:19,591 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 70 states. [2018-11-18 22:15:19,591 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 70 states. [2018-11-18 22:15:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:19,596 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-18 22:15:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2018-11-18 22:15:19,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:19,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:19,597 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 114 states. [2018-11-18 22:15:19,598 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 114 states. [2018-11-18 22:15:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:19,603 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-18 22:15:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2018-11-18 22:15:19,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:19,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:19,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:19,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 22:15:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-18 22:15:19,607 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 30 [2018-11-18 22:15:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:19,608 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-18 22:15:19,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:15:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-18 22:15:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:15:19,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:19,609 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 22:15:19,609 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:19,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash -299963129, now seen corresponding path program 1 times [2018-11-18 22:15:19,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:19,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:19,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:19,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:19,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {2249#true} call ULTIMATE.init(); {2249#true} is VALID [2018-11-18 22:15:19,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {2249#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2249#true} is VALID [2018-11-18 22:15:19,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {2249#true} assume true; {2249#true} is VALID [2018-11-18 22:15:19,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2249#true} {2249#true} #129#return; {2249#true} is VALID [2018-11-18 22:15:19,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {2249#true} call #t~ret20 := main(); {2249#true} is VALID [2018-11-18 22:15:19,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {2249#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {2249#true} is VALID [2018-11-18 22:15:19,756 INFO L256 TraceCheckUtils]: 6: Hoare triple {2249#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2249#true} is VALID [2018-11-18 22:15:19,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {2249#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {2249#true} is VALID [2018-11-18 22:15:19,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {2249#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {2249#true} is VALID [2018-11-18 22:15:19,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {2249#true} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {2249#true} is VALID [2018-11-18 22:15:19,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {2249#true} assume #t~switch3; {2249#true} is VALID [2018-11-18 22:15:19,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {2249#true} assume true; {2249#true} is VALID [2018-11-18 22:15:19,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {2249#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {2249#true} is VALID [2018-11-18 22:15:19,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {2249#true} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {2249#true} is VALID [2018-11-18 22:15:19,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#true} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {2249#true} is VALID [2018-11-18 22:15:19,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {2249#true} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {2249#true} is VALID [2018-11-18 22:15:19,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {2249#true} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2249#true} is VALID [2018-11-18 22:15:19,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {2249#true} ~j~0 := ~bvsub32(~i~0, 1bv32); {2249#true} is VALID [2018-11-18 22:15:19,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {2249#true} assume true; {2249#true} is VALID [2018-11-18 22:15:19,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {2249#true} #t~short13 := ~bvslt32(0bv32, ~j~0); {2249#true} is VALID [2018-11-18 22:15:19,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {2249#true} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {2249#true} is VALID [2018-11-18 22:15:19,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {2249#true} assume #t~short12; {2317#|parse_expression_list_#t~short12|} is VALID [2018-11-18 22:15:19,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {2317#|parse_expression_list_#t~short12|} #t~short13 := #t~short12; {2321#|parse_expression_list_#t~short13|} is VALID [2018-11-18 22:15:19,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {2321#|parse_expression_list_#t~short13|} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {2250#false} is VALID [2018-11-18 22:15:19,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {2250#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {2250#false} is VALID [2018-11-18 22:15:19,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {2250#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {2250#false} is VALID [2018-11-18 22:15:19,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {2250#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {2250#false} is VALID [2018-11-18 22:15:19,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {2250#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {2250#false} is VALID [2018-11-18 22:15:19,767 INFO L256 TraceCheckUtils]: 28: Hoare triple {2250#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {2250#false} is VALID [2018-11-18 22:15:19,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {2250#false} ~cond := #in~cond; {2250#false} is VALID [2018-11-18 22:15:19,767 INFO L273 TraceCheckUtils]: 30: Hoare triple {2250#false} assume 0bv32 == ~cond; {2250#false} is VALID [2018-11-18 22:15:19,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {2250#false} assume !false; {2250#false} is VALID [2018-11-18 22:15:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:19,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:19,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:19,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:15:19,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-18 22:15:19,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:19,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:15:19,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:19,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:15:19,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:15:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:15:19,977 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states. [2018-11-18 22:15:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:20,282 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2018-11-18 22:15:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:15:20,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-18 22:15:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:15:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-18 22:15:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:15:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-18 22:15:20,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-18 22:15:20,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:20,412 INFO L225 Difference]: With dead ends: 113 [2018-11-18 22:15:20,412 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 22:15:20,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-11-18 22:15:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 22:15:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-18 22:15:20,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:20,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-18 22:15:20,433 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-18 22:15:20,433 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-18 22:15:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:20,436 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-18 22:15:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-11-18 22:15:20,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:20,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:20,437 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-18 22:15:20,437 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-18 22:15:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:20,441 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-18 22:15:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-11-18 22:15:20,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:20,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:20,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:20,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 22:15:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2018-11-18 22:15:20,445 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 32 [2018-11-18 22:15:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:20,445 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2018-11-18 22:15:20,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:15:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-11-18 22:15:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 22:15:20,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:20,446 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 22:15:20,447 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:20,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash 401101449, now seen corresponding path program 1 times [2018-11-18 22:15:20,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:20,447 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:20,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:20,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:20,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {2718#true} call ULTIMATE.init(); {2718#true} is VALID [2018-11-18 22:15:20,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {2718#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2718#true} is VALID [2018-11-18 22:15:20,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {2718#true} assume true; {2718#true} is VALID [2018-11-18 22:15:20,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} #129#return; {2718#true} is VALID [2018-11-18 22:15:20,657 INFO L256 TraceCheckUtils]: 4: Hoare triple {2718#true} call #t~ret20 := main(); {2718#true} is VALID [2018-11-18 22:15:20,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {2718#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {2718#true} is VALID [2018-11-18 22:15:20,657 INFO L256 TraceCheckUtils]: 6: Hoare triple {2718#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2718#true} is VALID [2018-11-18 22:15:20,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {2718#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {2744#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:20,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {2744#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {2744#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:20,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {2744#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} assume #t~switch3; {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} assume true; {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2751#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:20,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {2751#(= (_ bv0 32) parse_expression_list_~i~0)} ~j~0 := ~bvsub32(~i~0, 1bv32); {2776#(= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:20,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#(= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32))} assume true; {2776#(= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:20,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#(= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {2783#(not |parse_expression_list_#t~short13|)} is VALID [2018-11-18 22:15:20,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {2783#(not |parse_expression_list_#t~short13|)} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {2719#false} is VALID [2018-11-18 22:15:20,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {2719#false} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {2719#false} is VALID [2018-11-18 22:15:20,669 INFO L273 TraceCheckUtils]: 22: Hoare triple {2719#false} #t~short13 := #t~short12; {2719#false} is VALID [2018-11-18 22:15:20,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {2719#false} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {2719#false} is VALID [2018-11-18 22:15:20,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {2719#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {2719#false} is VALID [2018-11-18 22:15:20,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {2719#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {2719#false} is VALID [2018-11-18 22:15:20,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {2719#false} is VALID [2018-11-18 22:15:20,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {2719#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {2719#false} is VALID [2018-11-18 22:15:20,670 INFO L256 TraceCheckUtils]: 28: Hoare triple {2719#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {2719#false} is VALID [2018-11-18 22:15:20,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {2719#false} ~cond := #in~cond; {2719#false} is VALID [2018-11-18 22:15:20,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {2719#false} assume 0bv32 == ~cond; {2719#false} is VALID [2018-11-18 22:15:20,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {2719#false} assume !false; {2719#false} is VALID [2018-11-18 22:15:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:20,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:20,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:20,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 22:15:20,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-18 22:15:20,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:20,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:15:20,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:20,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:15:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:15:20,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:15:20,796 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand 6 states. [2018-11-18 22:15:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:21,530 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2018-11-18 22:15:21,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:15:21,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-11-18 22:15:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:15:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2018-11-18 22:15:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:15:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2018-11-18 22:15:21,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 136 transitions. [2018-11-18 22:15:21,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:21,740 INFO L225 Difference]: With dead ends: 146 [2018-11-18 22:15:21,740 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 22:15:21,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:15:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 22:15:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2018-11-18 22:15:21,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:21,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 70 states. [2018-11-18 22:15:21,766 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 70 states. [2018-11-18 22:15:21,766 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 70 states. [2018-11-18 22:15:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:21,771 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-11-18 22:15:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2018-11-18 22:15:21,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:21,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:21,772 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 96 states. [2018-11-18 22:15:21,772 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 96 states. [2018-11-18 22:15:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:21,776 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-11-18 22:15:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2018-11-18 22:15:21,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:21,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:21,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:21,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 22:15:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-11-18 22:15:21,780 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 32 [2018-11-18 22:15:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:21,780 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-11-18 22:15:21,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:15:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-11-18 22:15:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:15:21,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:21,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:15:21,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:21,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 548956440, now seen corresponding path program 1 times [2018-11-18 22:15:21,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:21,783 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:21,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:21,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:22,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {3275#true} call ULTIMATE.init(); {3275#true} is VALID [2018-11-18 22:15:22,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {3275#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3275#true} is VALID [2018-11-18 22:15:22,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#true} assume true; {3275#true} is VALID [2018-11-18 22:15:22,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#true} {3275#true} #129#return; {3275#true} is VALID [2018-11-18 22:15:22,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#true} call #t~ret20 := main(); {3275#true} is VALID [2018-11-18 22:15:22,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {3275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {3275#true} is VALID [2018-11-18 22:15:22,111 INFO L256 TraceCheckUtils]: 6: Hoare triple {3275#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3275#true} is VALID [2018-11-18 22:15:22,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {3275#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {3301#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {3301#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {3301#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {3301#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:22,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:22,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true; {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:22,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:22,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~short6; {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:22,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {3308#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6;#t~post7 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} assume true; {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {3324#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3343#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {3343#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (_ bv0 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume true; {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short13 := ~bvslt32(0bv32, ~j~0); {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13; {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short16 := ~bvslt32(0bv32, ~j~0); {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16; {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:22,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {3347#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {3276#false} is VALID [2018-11-18 22:15:22,139 INFO L256 TraceCheckUtils]: 30: Hoare triple {3276#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {3276#false} is VALID [2018-11-18 22:15:22,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {3276#false} ~cond := #in~cond; {3276#false} is VALID [2018-11-18 22:15:22,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {3276#false} assume 0bv32 == ~cond; {3276#false} is VALID [2018-11-18 22:15:22,140 INFO L273 TraceCheckUtils]: 33: Hoare triple {3276#false} assume !false; {3276#false} is VALID [2018-11-18 22:15:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:22,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:15:22,456 INFO L273 TraceCheckUtils]: 33: Hoare triple {3276#false} assume !false; {3276#false} is VALID [2018-11-18 22:15:22,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {3276#false} assume 0bv32 == ~cond; {3276#false} is VALID [2018-11-18 22:15:22,456 INFO L273 TraceCheckUtils]: 31: Hoare triple {3276#false} ~cond := #in~cond; {3276#false} is VALID [2018-11-18 22:15:22,456 INFO L256 TraceCheckUtils]: 30: Hoare triple {3276#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {3276#false} is VALID [2018-11-18 22:15:22,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {3276#false} is VALID [2018-11-18 22:15:22,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short16; {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,462 INFO L273 TraceCheckUtils]: 26: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short13; {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume true; {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {3421#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} ~j~0 := ~bvsub32(~i~0, 1bv32); {3396#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:22,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3421#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume true; {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume !!#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6;#t~post7 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3425#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~short6; {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume true; {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~switch3; {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {3460#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {3444#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:22,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {3460#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {3460#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {3275#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {3460#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:22,535 INFO L256 TraceCheckUtils]: 6: Hoare triple {3275#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3275#true} is VALID [2018-11-18 22:15:22,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {3275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {3275#true} is VALID [2018-11-18 22:15:22,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#true} call #t~ret20 := main(); {3275#true} is VALID [2018-11-18 22:15:22,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#true} {3275#true} #129#return; {3275#true} is VALID [2018-11-18 22:15:22,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#true} assume true; {3275#true} is VALID [2018-11-18 22:15:22,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {3275#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3275#true} is VALID [2018-11-18 22:15:22,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {3275#true} call ULTIMATE.init(); {3275#true} is VALID [2018-11-18 22:15:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:22,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:15:22,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 22:15:22,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-18 22:15:22,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:22,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:15:22,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:22,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:15:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:15:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:15:22,685 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 12 states. [2018-11-18 22:15:23,209 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-18 22:15:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:30,111 INFO L93 Difference]: Finished difference Result 369 states and 470 transitions. [2018-11-18 22:15:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:15:30,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-18 22:15:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:15:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 362 transitions. [2018-11-18 22:15:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:15:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 362 transitions. [2018-11-18 22:15:30,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 362 transitions. [2018-11-18 22:15:31,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:31,361 INFO L225 Difference]: With dead ends: 369 [2018-11-18 22:15:31,361 INFO L226 Difference]: Without dead ends: 287 [2018-11-18 22:15:31,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:15:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-18 22:15:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 135. [2018-11-18 22:15:31,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:31,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand 135 states. [2018-11-18 22:15:31,980 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 135 states. [2018-11-18 22:15:31,980 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 135 states. [2018-11-18 22:15:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:31,992 INFO L93 Difference]: Finished difference Result 287 states and 365 transitions. [2018-11-18 22:15:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 365 transitions. [2018-11-18 22:15:31,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:31,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:31,993 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 287 states. [2018-11-18 22:15:31,993 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 287 states. [2018-11-18 22:15:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:32,004 INFO L93 Difference]: Finished difference Result 287 states and 365 transitions. [2018-11-18 22:15:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 365 transitions. [2018-11-18 22:15:32,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:32,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:32,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:32,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 22:15:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2018-11-18 22:15:32,010 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 34 [2018-11-18 22:15:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:32,011 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2018-11-18 22:15:32,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:15:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2018-11-18 22:15:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:15:32,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:32,012 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:15:32,012 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:32,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1245522479, now seen corresponding path program 1 times [2018-11-18 22:15:32,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:32,013 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:32,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:32,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {4673#true} call ULTIMATE.init(); {4673#true} is VALID [2018-11-18 22:15:32,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {4673#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4673#true} is VALID [2018-11-18 22:15:32,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {4673#true} assume true; {4673#true} is VALID [2018-11-18 22:15:32,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4673#true} {4673#true} #129#return; {4673#true} is VALID [2018-11-18 22:15:32,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {4673#true} call #t~ret20 := main(); {4673#true} is VALID [2018-11-18 22:15:32,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {4673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {4673#true} is VALID [2018-11-18 22:15:32,382 INFO L256 TraceCheckUtils]: 6: Hoare triple {4673#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4673#true} is VALID [2018-11-18 22:15:32,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {4699#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:32,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {4699#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {4699#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:15:32,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {4699#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:32,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:32,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:32,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:32,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:15:32,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {4706#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume #t~switch3; {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume true; {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:32,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {4722#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume true; {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13; {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,420 INFO L273 TraceCheckUtils]: 26: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short16; {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:32,426 INFO L256 TraceCheckUtils]: 31: Hoare triple {4747#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {4775#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:32,428 INFO L273 TraceCheckUtils]: 32: Hoare triple {4775#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4779#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:32,428 INFO L273 TraceCheckUtils]: 33: Hoare triple {4779#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4674#false} is VALID [2018-11-18 22:15:32,429 INFO L273 TraceCheckUtils]: 34: Hoare triple {4674#false} assume !false; {4674#false} is VALID [2018-11-18 22:15:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:32,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:15:32,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {4674#false} assume !false; {4674#false} is VALID [2018-11-18 22:15:32,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {4789#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4674#false} is VALID [2018-11-18 22:15:32,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {4793#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4789#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:15:32,917 INFO L256 TraceCheckUtils]: 31: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {4793#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:15:32,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,929 INFO L273 TraceCheckUtils]: 28: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short16; {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short16 := ~bvslt32(0bv32, ~j~0); {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short13; {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:32,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume true; {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} ~j~0 := ~bvsub32(~i~0, 1bv32); {4797#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume true; {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume #t~switch3; {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {4825#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~switch3; {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {4866#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {4850#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {4866#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {4866#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {4866#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-18 22:15:33,444 INFO L256 TraceCheckUtils]: 6: Hoare triple {4673#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4673#true} is VALID [2018-11-18 22:15:33,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {4673#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {4673#true} is VALID [2018-11-18 22:15:33,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {4673#true} call #t~ret20 := main(); {4673#true} is VALID [2018-11-18 22:15:33,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4673#true} {4673#true} #129#return; {4673#true} is VALID [2018-11-18 22:15:33,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {4673#true} assume true; {4673#true} is VALID [2018-11-18 22:15:33,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {4673#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4673#true} is VALID [2018-11-18 22:15:33,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {4673#true} call ULTIMATE.init(); {4673#true} is VALID [2018-11-18 22:15:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:33,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:15:33,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 22:15:33,452 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-18 22:15:33,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:33,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:15:33,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:33,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:15:33,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:15:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:15:33,934 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand 14 states. [2018-11-18 22:15:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:50,515 INFO L93 Difference]: Finished difference Result 458 states and 591 transitions. [2018-11-18 22:15:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:15:50,515 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-18 22:15:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:15:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 395 transitions. [2018-11-18 22:15:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:15:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 395 transitions. [2018-11-18 22:15:50,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 395 transitions. [2018-11-18 22:15:54,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:55,007 INFO L225 Difference]: With dead ends: 458 [2018-11-18 22:15:55,007 INFO L226 Difference]: Without dead ends: 456 [2018-11-18 22:15:55,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:15:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-18 22:15:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 185. [2018-11-18 22:15:55,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:55,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 456 states. Second operand 185 states. [2018-11-18 22:15:55,187 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 185 states. [2018-11-18 22:15:55,187 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 185 states. [2018-11-18 22:15:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:55,208 INFO L93 Difference]: Finished difference Result 456 states and 589 transitions. [2018-11-18 22:15:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 589 transitions. [2018-11-18 22:15:55,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:55,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:55,210 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 456 states. [2018-11-18 22:15:55,210 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 456 states. [2018-11-18 22:15:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:55,241 INFO L93 Difference]: Finished difference Result 456 states and 589 transitions. [2018-11-18 22:15:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 589 transitions. [2018-11-18 22:15:55,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:55,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:55,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:55,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 22:15:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2018-11-18 22:15:55,256 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 35 [2018-11-18 22:15:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:55,259 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2018-11-18 22:15:55,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:15:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2018-11-18 22:15:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 22:15:55,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:55,260 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:15:55,260 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:55,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -331181704, now seen corresponding path program 1 times [2018-11-18 22:15:55,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:55,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:55,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:55,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:55,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {6575#true} call ULTIMATE.init(); {6575#true} is VALID [2018-11-18 22:15:55,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {6575#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6575#true} is VALID [2018-11-18 22:15:55,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {6575#true} assume true; {6575#true} is VALID [2018-11-18 22:15:55,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6575#true} {6575#true} #129#return; {6575#true} is VALID [2018-11-18 22:15:55,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {6575#true} call #t~ret20 := main(); {6575#true} is VALID [2018-11-18 22:15:55,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {6575#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {6575#true} is VALID [2018-11-18 22:15:55,628 INFO L256 TraceCheckUtils]: 6: Hoare triple {6575#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {6575#true} is VALID [2018-11-18 22:15:55,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {6575#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {6601#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:55,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {6601#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {6601#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:55,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {6601#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {6608#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {6608#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~switch3; {6608#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {6608#(= (_ bv0 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {6608#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {6608#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {6608#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {6608#(= (_ bv0 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {6608#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {6608#(= (_ bv0 32) parse_expression_list_~i~0)} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} assume #t~switch3; {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} assume true; {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {6624#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:55,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {6624#(= (_ bv1 32) parse_expression_list_~i~0)} ~j~0 := ~bvsub32(~i~0, 1bv32); {6649#(= (_ bv0 32) parse_expression_list_~j~0)} is VALID [2018-11-18 22:15:55,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {6649#(= (_ bv0 32) parse_expression_list_~j~0)} assume true; {6649#(= (_ bv0 32) parse_expression_list_~j~0)} is VALID [2018-11-18 22:15:55,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {6649#(= (_ bv0 32) parse_expression_list_~j~0)} #t~short13 := ~bvslt32(0bv32, ~j~0); {6656#(not |parse_expression_list_#t~short13|)} is VALID [2018-11-18 22:15:55,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {6656#(not |parse_expression_list_#t~short13|)} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {6576#false} is VALID [2018-11-18 22:15:55,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {6576#false} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {6576#false} is VALID [2018-11-18 22:15:55,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {6576#false} #t~short13 := #t~short12; {6576#false} is VALID [2018-11-18 22:15:55,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {6576#false} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {6576#false} is VALID [2018-11-18 22:15:55,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {6576#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {6576#false} is VALID [2018-11-18 22:15:55,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {6576#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {6576#false} is VALID [2018-11-18 22:15:55,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {6576#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {6576#false} is VALID [2018-11-18 22:15:55,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {6576#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {6576#false} is VALID [2018-11-18 22:15:55,652 INFO L256 TraceCheckUtils]: 33: Hoare triple {6576#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {6576#false} is VALID [2018-11-18 22:15:55,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {6576#false} ~cond := #in~cond; {6576#false} is VALID [2018-11-18 22:15:55,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {6576#false} assume 0bv32 == ~cond; {6576#false} is VALID [2018-11-18 22:15:55,653 INFO L273 TraceCheckUtils]: 36: Hoare triple {6576#false} assume !false; {6576#false} is VALID [2018-11-18 22:15:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:55,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:15:55,753 INFO L273 TraceCheckUtils]: 36: Hoare triple {6576#false} assume !false; {6576#false} is VALID [2018-11-18 22:15:55,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {6576#false} assume 0bv32 == ~cond; {6576#false} is VALID [2018-11-18 22:15:55,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {6576#false} ~cond := #in~cond; {6576#false} is VALID [2018-11-18 22:15:55,754 INFO L256 TraceCheckUtils]: 33: Hoare triple {6576#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {6576#false} is VALID [2018-11-18 22:15:55,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {6576#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {6576#false} is VALID [2018-11-18 22:15:55,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {6576#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {6576#false} is VALID [2018-11-18 22:15:55,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {6576#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {6576#false} is VALID [2018-11-18 22:15:55,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {6576#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {6576#false} is VALID [2018-11-18 22:15:55,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {6576#false} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {6576#false} is VALID [2018-11-18 22:15:55,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {6576#false} #t~short13 := #t~short12; {6576#false} is VALID [2018-11-18 22:15:55,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {6576#false} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {6576#false} is VALID [2018-11-18 22:15:55,756 INFO L273 TraceCheckUtils]: 25: Hoare triple {6656#(not |parse_expression_list_#t~short13|)} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {6576#false} is VALID [2018-11-18 22:15:55,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {6729#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {6656#(not |parse_expression_list_#t~short13|)} is VALID [2018-11-18 22:15:55,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {6729#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} assume true; {6729#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:55,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} ~j~0 := ~bvsub32(~i~0, 1bv32); {6729#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:15:55,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume true; {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~switch3; {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {6736#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:15:55,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:55,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:55,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:55,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} assume !#t~switch3; {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:55,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {6777#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {6761#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:15:55,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {6777#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {6777#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} is VALID [2018-11-18 22:15:55,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {6575#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {6777#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} is VALID [2018-11-18 22:15:55,769 INFO L256 TraceCheckUtils]: 6: Hoare triple {6575#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {6575#true} is VALID [2018-11-18 22:15:55,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {6575#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {6575#true} is VALID [2018-11-18 22:15:55,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {6575#true} call #t~ret20 := main(); {6575#true} is VALID [2018-11-18 22:15:55,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6575#true} {6575#true} #129#return; {6575#true} is VALID [2018-11-18 22:15:55,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {6575#true} assume true; {6575#true} is VALID [2018-11-18 22:15:55,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {6575#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6575#true} is VALID [2018-11-18 22:15:55,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {6575#true} call ULTIMATE.init(); {6575#true} is VALID [2018-11-18 22:15:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:55,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:15:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 22:15:55,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-18 22:15:55,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:55,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:15:55,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:55,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:15:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:15:55,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:15:55,851 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand 11 states. [2018-11-18 22:15:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:58,193 INFO L93 Difference]: Finished difference Result 379 states and 485 transitions. [2018-11-18 22:15:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:15:58,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-18 22:15:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:15:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:15:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2018-11-18 22:15:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:15:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 184 transitions. [2018-11-18 22:15:58,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 184 transitions. [2018-11-18 22:15:58,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:58,763 INFO L225 Difference]: With dead ends: 379 [2018-11-18 22:15:58,763 INFO L226 Difference]: Without dead ends: 285 [2018-11-18 22:15:58,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:15:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-18 22:15:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 211. [2018-11-18 22:15:58,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:15:58,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand 211 states. [2018-11-18 22:15:58,865 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 211 states. [2018-11-18 22:15:58,865 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 211 states. [2018-11-18 22:15:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:58,873 INFO L93 Difference]: Finished difference Result 285 states and 359 transitions. [2018-11-18 22:15:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 359 transitions. [2018-11-18 22:15:58,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:58,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:58,875 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 285 states. [2018-11-18 22:15:58,875 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 285 states. [2018-11-18 22:15:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:15:58,883 INFO L93 Difference]: Finished difference Result 285 states and 359 transitions. [2018-11-18 22:15:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 359 transitions. [2018-11-18 22:15:58,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:15:58,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:15:58,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:15:58,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:15:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-18 22:15:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2018-11-18 22:15:58,889 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 37 [2018-11-18 22:15:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:15:58,890 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2018-11-18 22:15:58,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:15:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2018-11-18 22:15:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 22:15:58,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:58,891 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:15:58,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:58,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 948125090, now seen corresponding path program 1 times [2018-11-18 22:15:58,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:15:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:15:58,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:59,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:59,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {8085#true} call ULTIMATE.init(); {8085#true} is VALID [2018-11-18 22:15:59,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {8085#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {8085#true} is VALID [2018-11-18 22:15:59,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {8085#true} assume true; {8085#true} is VALID [2018-11-18 22:15:59,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8085#true} {8085#true} #129#return; {8085#true} is VALID [2018-11-18 22:15:59,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {8085#true} call #t~ret20 := main(); {8085#true} is VALID [2018-11-18 22:15:59,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {8085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {8085#true} is VALID [2018-11-18 22:15:59,483 INFO L256 TraceCheckUtils]: 6: Hoare triple {8085#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {8085#true} is VALID [2018-11-18 22:15:59,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {8085#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {8111#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:59,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {8111#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {8111#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-18 22:15:59,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {8111#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {8118#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {8118#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~switch3; {8118#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {8118#(= (_ bv0 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {8118#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {8118#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {8118#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {8118#(= (_ bv0 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {8118#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {8118#(= (_ bv0 32) parse_expression_list_~i~0)} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {8134#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {8134#(= (_ bv1 32) parse_expression_list_~i~0)} assume !#t~switch3; {8134#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {8134#(= (_ bv1 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {8134#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {8134#(= (_ bv1 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {8134#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {8134#(= (_ bv1 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {8134#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {8134#(= (_ bv1 32) parse_expression_list_~i~0)} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} assume #t~switch3; {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} assume true; {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,500 INFO L273 TraceCheckUtils]: 25: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {8150#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {8150#(= (_ bv2 32) parse_expression_list_~i~0)} ~j~0 := ~bvsub32(~i~0, 1bv32); {8175#(= (_ bv1 32) parse_expression_list_~j~0)} is VALID [2018-11-18 22:15:59,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {8175#(= (_ bv1 32) parse_expression_list_~j~0)} assume true; {8175#(= (_ bv1 32) parse_expression_list_~j~0)} is VALID [2018-11-18 22:15:59,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {8175#(= (_ bv1 32) parse_expression_list_~j~0)} #t~short13 := ~bvslt32(0bv32, ~j~0); {8182#|parse_expression_list_#t~short13|} is VALID [2018-11-18 22:15:59,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {8182#|parse_expression_list_#t~short13|} assume !#t~short13; {8086#false} is VALID [2018-11-18 22:15:59,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {8086#false} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {8086#false} is VALID [2018-11-18 22:15:59,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {8086#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {8086#false} is VALID [2018-11-18 22:15:59,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {8086#false} assume !#t~short16; {8086#false} is VALID [2018-11-18 22:15:59,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {8086#false} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {8086#false} is VALID [2018-11-18 22:15:59,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {8086#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {8086#false} is VALID [2018-11-18 22:15:59,504 INFO L256 TraceCheckUtils]: 36: Hoare triple {8086#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {8086#false} is VALID [2018-11-18 22:15:59,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {8086#false} ~cond := #in~cond; {8086#false} is VALID [2018-11-18 22:15:59,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {8086#false} assume 0bv32 == ~cond; {8086#false} is VALID [2018-11-18 22:15:59,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {8086#false} assume !false; {8086#false} is VALID [2018-11-18 22:15:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:59,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:15:59,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {8086#false} assume !false; {8086#false} is VALID [2018-11-18 22:15:59,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {8086#false} assume 0bv32 == ~cond; {8086#false} is VALID [2018-11-18 22:15:59,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {8086#false} ~cond := #in~cond; {8086#false} is VALID [2018-11-18 22:15:59,800 INFO L256 TraceCheckUtils]: 36: Hoare triple {8086#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {8086#false} is VALID [2018-11-18 22:15:59,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {8086#false} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {8086#false} is VALID [2018-11-18 22:15:59,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {8086#false} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {8086#false} is VALID [2018-11-18 22:15:59,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {8086#false} assume !#t~short16; {8086#false} is VALID [2018-11-18 22:15:59,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {8086#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {8086#false} is VALID [2018-11-18 22:15:59,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {8086#false} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {8086#false} is VALID [2018-11-18 22:15:59,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {8182#|parse_expression_list_#t~short13|} assume !#t~short13; {8086#false} is VALID [2018-11-18 22:15:59,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {8243#(bvslt (_ bv0 32) parse_expression_list_~j~0)} #t~short13 := ~bvslt32(0bv32, ~j~0); {8182#|parse_expression_list_#t~short13|} is VALID [2018-11-18 22:15:59,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {8243#(bvslt (_ bv0 32) parse_expression_list_~j~0)} assume true; {8243#(bvslt (_ bv0 32) parse_expression_list_~j~0)} is VALID [2018-11-18 22:15:59,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} ~j~0 := ~bvsub32(~i~0, 1bv32); {8243#(bvslt (_ bv0 32) parse_expression_list_~j~0)} is VALID [2018-11-18 22:15:59,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume true; {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume #t~switch3; {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {8250#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-18 22:15:59,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} assume !#t~switch3; {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {8275#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-18 22:15:59,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-18 22:15:59,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-18 22:15:59,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} havoc #t~mem2;havoc #t~switch3; {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-18 22:15:59,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} assume !#t~switch3; {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-18 22:15:59,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {8307#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {8291#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-18 22:15:59,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {8307#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {8307#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} is VALID [2018-11-18 22:15:59,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {8085#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {8307#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} is VALID [2018-11-18 22:15:59,825 INFO L256 TraceCheckUtils]: 6: Hoare triple {8085#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {8085#true} is VALID [2018-11-18 22:15:59,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {8085#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {8085#true} is VALID [2018-11-18 22:15:59,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {8085#true} call #t~ret20 := main(); {8085#true} is VALID [2018-11-18 22:15:59,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8085#true} {8085#true} #129#return; {8085#true} is VALID [2018-11-18 22:15:59,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {8085#true} assume true; {8085#true} is VALID [2018-11-18 22:15:59,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {8085#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {8085#true} is VALID [2018-11-18 22:15:59,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {8085#true} call ULTIMATE.init(); {8085#true} is VALID [2018-11-18 22:15:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:59,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:15:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-18 22:15:59,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-18 22:15:59,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:59,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:15:59,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:59,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:15:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:15:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:15:59,927 INFO L87 Difference]: Start difference. First operand 211 states and 266 transitions. Second operand 13 states. [2018-11-18 22:16:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:06,014 INFO L93 Difference]: Finished difference Result 887 states and 1156 transitions. [2018-11-18 22:16:06,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 22:16:06,014 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-18 22:16:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:16:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 568 transitions. [2018-11-18 22:16:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:16:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 568 transitions. [2018-11-18 22:16:06,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 568 transitions. [2018-11-18 22:16:07,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:07,497 INFO L225 Difference]: With dead ends: 887 [2018-11-18 22:16:07,497 INFO L226 Difference]: Without dead ends: 813 [2018-11-18 22:16:07,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:16:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-11-18 22:16:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 512. [2018-11-18 22:16:07,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:07,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 813 states. Second operand 512 states. [2018-11-18 22:16:07,803 INFO L74 IsIncluded]: Start isIncluded. First operand 813 states. Second operand 512 states. [2018-11-18 22:16:07,803 INFO L87 Difference]: Start difference. First operand 813 states. Second operand 512 states. [2018-11-18 22:16:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:07,848 INFO L93 Difference]: Finished difference Result 813 states and 1053 transitions. [2018-11-18 22:16:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1053 transitions. [2018-11-18 22:16:07,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:07,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:07,851 INFO L74 IsIncluded]: Start isIncluded. First operand 512 states. Second operand 813 states. [2018-11-18 22:16:07,851 INFO L87 Difference]: Start difference. First operand 512 states. Second operand 813 states. [2018-11-18 22:16:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:07,896 INFO L93 Difference]: Finished difference Result 813 states and 1053 transitions. [2018-11-18 22:16:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1053 transitions. [2018-11-18 22:16:07,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:07,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:07,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:07,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-11-18 22:16:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 657 transitions. [2018-11-18 22:16:07,921 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 657 transitions. Word has length 40 [2018-11-18 22:16:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:07,921 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 657 transitions. [2018-11-18 22:16:07,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:16:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 657 transitions. [2018-11-18 22:16:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:16:07,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:07,923 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:07,923 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:07,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash 611667945, now seen corresponding path program 2 times [2018-11-18 22:16:07,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:16:07,953 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:16:08,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:16:08,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:08,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:08,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {11638#true} call ULTIMATE.init(); {11638#true} is VALID [2018-11-18 22:16:08,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {11638#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {11638#true} is VALID [2018-11-18 22:16:08,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {11638#true} assume true; {11638#true} is VALID [2018-11-18 22:16:08,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11638#true} {11638#true} #129#return; {11638#true} is VALID [2018-11-18 22:16:08,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {11638#true} call #t~ret20 := main(); {11638#true} is VALID [2018-11-18 22:16:08,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {11638#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {11638#true} is VALID [2018-11-18 22:16:08,486 INFO L256 TraceCheckUtils]: 6: Hoare triple {11638#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {11638#true} is VALID [2018-11-18 22:16:08,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {11638#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {11664#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:08,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {11664#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {11664#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:08,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {11664#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {11671#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:08,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~switch3; {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:08,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:08,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:08,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:08,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {11687#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true; {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:08,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {11703#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {11725#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:08,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {11725#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume true; {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {11736#(and |parse_expression_list_#t~short13| (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {11736#(and |parse_expression_list_#t~short13| (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,519 INFO L273 TraceCheckUtils]: 32: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := #t~short12; {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {11729#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {11758#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:08,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {11758#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {11639#false} is VALID [2018-11-18 22:16:08,524 INFO L256 TraceCheckUtils]: 38: Hoare triple {11639#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {11639#false} is VALID [2018-11-18 22:16:08,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {11639#false} ~cond := #in~cond; {11639#false} is VALID [2018-11-18 22:16:08,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {11639#false} assume 0bv32 == ~cond; {11639#false} is VALID [2018-11-18 22:16:08,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {11639#false} assume !false; {11639#false} is VALID [2018-11-18 22:16:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:08,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:09,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {11639#false} assume !false; {11639#false} is VALID [2018-11-18 22:16:09,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {11639#false} assume 0bv32 == ~cond; {11639#false} is VALID [2018-11-18 22:16:09,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {11639#false} ~cond := #in~cond; {11639#false} is VALID [2018-11-18 22:16:09,025 INFO L256 TraceCheckUtils]: 38: Hoare triple {11639#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {11639#false} is VALID [2018-11-18 22:16:09,025 INFO L273 TraceCheckUtils]: 37: Hoare triple {11786#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {11639#false} is VALID [2018-11-18 22:16:09,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {11786#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:09,045 INFO L273 TraceCheckUtils]: 35: Hoare triple {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:16:09,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} #t~short16 := ~bvslt32(0bv32, ~j~0); {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:16:09,045 INFO L273 TraceCheckUtils]: 33: Hoare triple {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:16:09,046 INFO L273 TraceCheckUtils]: 32: Hoare triple {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} #t~short13 := #t~short12; {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:16:09,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:16:09,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {11809#(or (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32)))) (not |parse_expression_list_#t~short13|))} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {11790#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-18 22:16:09,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {11813#(or (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~j~0)))} #t~short13 := ~bvslt32(0bv32, ~j~0); {11809#(or (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32)))) (not |parse_expression_list_#t~short13|))} is VALID [2018-11-18 22:16:09,048 INFO L273 TraceCheckUtils]: 28: Hoare triple {11813#(or (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~j~0)))} assume true; {11813#(or (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~j~0)))} is VALID [2018-11-18 22:16:09,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {11820#(or (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))))} ~j~0 := ~bvsub32(~i~0, 1bv32); {11813#(or (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~j~0)))} is VALID [2018-11-18 22:16:09,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {11820#(or (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))))} is VALID [2018-11-18 22:16:09,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,095 INFO L273 TraceCheckUtils]: 23: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,095 INFO L273 TraceCheckUtils]: 22: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} assume true; {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} assume #t~switch3; {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {11824#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967294 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))))} is VALID [2018-11-18 22:16:09,126 INFO L273 TraceCheckUtils]: 18: Hoare triple {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} is VALID [2018-11-18 22:16:09,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} is VALID [2018-11-18 22:16:09,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} havoc #t~mem2;havoc #t~switch3; {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} is VALID [2018-11-18 22:16:09,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} assume !#t~switch3; {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} is VALID [2018-11-18 22:16:09,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {11846#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))) (not (bvslt (_ bv0 32) parse_expression_list_~i~0)))} is VALID [2018-11-18 22:16:09,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} is VALID [2018-11-18 22:16:09,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} is VALID [2018-11-18 22:16:09,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} havoc #t~mem2;havoc #t~switch3; {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} is VALID [2018-11-18 22:16:09,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} assume !#t~switch3; {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} is VALID [2018-11-18 22:16:09,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {11878#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {11862#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) parse_expression_list_~i~0)) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))))} is VALID [2018-11-18 22:16:09,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {11878#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {11878#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))))} is VALID [2018-11-18 22:16:09,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {11638#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {11878#(or (not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32)))) (not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))))} is VALID [2018-11-18 22:16:09,154 INFO L256 TraceCheckUtils]: 6: Hoare triple {11638#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {11638#true} is VALID [2018-11-18 22:16:09,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {11638#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {11638#true} is VALID [2018-11-18 22:16:09,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {11638#true} call #t~ret20 := main(); {11638#true} is VALID [2018-11-18 22:16:09,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11638#true} {11638#true} #129#return; {11638#true} is VALID [2018-11-18 22:16:09,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {11638#true} assume true; {11638#true} is VALID [2018-11-18 22:16:09,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {11638#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {11638#true} is VALID [2018-11-18 22:16:09,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {11638#true} call ULTIMATE.init(); {11638#true} is VALID [2018-11-18 22:16:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:09,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-18 22:16:09,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-18 22:16:09,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:09,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:16:09,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:09,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:16:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:16:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:16:09,395 INFO L87 Difference]: Start difference. First operand 512 states and 657 transitions. Second operand 19 states. [2018-11-18 22:16:10,493 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-11-18 22:16:12,173 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-11-18 22:16:15,027 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-18 22:16:15,906 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-11-18 22:16:16,798 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-11-18 22:16:17,470 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:16:19,543 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-11-18 22:16:20,794 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-18 22:16:23,349 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 22:16:24,763 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-18 22:16:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:32,023 INFO L93 Difference]: Finished difference Result 1925 states and 2498 transitions. [2018-11-18 22:16:32,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 22:16:32,023 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-18 22:16:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:16:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 592 transitions. [2018-11-18 22:16:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:16:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 592 transitions. [2018-11-18 22:16:32,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 592 transitions. [2018-11-18 22:16:35,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:35,376 INFO L225 Difference]: With dead ends: 1925 [2018-11-18 22:16:35,376 INFO L226 Difference]: Without dead ends: 1463 [2018-11-18 22:16:35,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=616, Invalid=2464, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 22:16:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2018-11-18 22:16:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 732. [2018-11-18 22:16:35,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:35,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1463 states. Second operand 732 states. [2018-11-18 22:16:35,700 INFO L74 IsIncluded]: Start isIncluded. First operand 1463 states. Second operand 732 states. [2018-11-18 22:16:35,700 INFO L87 Difference]: Start difference. First operand 1463 states. Second operand 732 states. [2018-11-18 22:16:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:35,785 INFO L93 Difference]: Finished difference Result 1463 states and 1887 transitions. [2018-11-18 22:16:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1887 transitions. [2018-11-18 22:16:35,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:35,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:35,790 INFO L74 IsIncluded]: Start isIncluded. First operand 732 states. Second operand 1463 states. [2018-11-18 22:16:35,790 INFO L87 Difference]: Start difference. First operand 732 states. Second operand 1463 states. [2018-11-18 22:16:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:35,867 INFO L93 Difference]: Finished difference Result 1463 states and 1887 transitions. [2018-11-18 22:16:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1887 transitions. [2018-11-18 22:16:35,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:35,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:35,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:35,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-11-18 22:16:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 939 transitions. [2018-11-18 22:16:35,905 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 939 transitions. Word has length 42 [2018-11-18 22:16:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:35,905 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 939 transitions. [2018-11-18 22:16:35,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:16:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 939 transitions. [2018-11-18 22:16:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:16:35,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:35,907 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:35,907 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:35,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 668926247, now seen corresponding path program 1 times [2018-11-18 22:16:35,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:16:35,908 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:16:35,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:16:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:36,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:36,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {17963#true} call ULTIMATE.init(); {17963#true} is VALID [2018-11-18 22:16:36,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {17963#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {17963#true} is VALID [2018-11-18 22:16:36,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {17963#true} assume true; {17963#true} is VALID [2018-11-18 22:16:36,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17963#true} {17963#true} #129#return; {17963#true} is VALID [2018-11-18 22:16:36,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {17963#true} call #t~ret20 := main(); {17963#true} is VALID [2018-11-18 22:16:36,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {17963#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {17963#true} is VALID [2018-11-18 22:16:36,223 INFO L256 TraceCheckUtils]: 6: Hoare triple {17963#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {17963#true} is VALID [2018-11-18 22:16:36,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {17963#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {17989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:36,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {17989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {17989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:36,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {17989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {17996#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:36,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~switch3; {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:36,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:36,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:36,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:36,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {18012#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,233 INFO L273 TraceCheckUtils]: 20: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true; {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:36,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {18028#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {18050#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:16:36,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {18050#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume true; {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := #t~short12; {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:16:36,249 INFO L256 TraceCheckUtils]: 38: Hoare triple {18054#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {18088#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:36,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {18088#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {18092#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:36,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {18092#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {17964#false} is VALID [2018-11-18 22:16:36,250 INFO L273 TraceCheckUtils]: 41: Hoare triple {17964#false} assume !false; {17964#false} is VALID [2018-11-18 22:16:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:36,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:36,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {17964#false} assume !false; {17964#false} is VALID [2018-11-18 22:16:36,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {18102#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {17964#false} is VALID [2018-11-18 22:16:36,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {18106#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {18102#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:16:36,698 INFO L256 TraceCheckUtils]: 38: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {18106#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:16:36,699 INFO L273 TraceCheckUtils]: 37: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short16 := ~bvslt32(0bv32, ~j~0); {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short13 := #t~short12; {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume true; {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} ~j~0 := ~bvsub32(~i~0, 1bv32); {18110#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:16:36,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:36,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:36,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:36,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:36,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} assume true; {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:36,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} assume #t~switch3; {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:37,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {18148#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-18 22:16:37,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~switch3; {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {18144#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~switch3; {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {18201#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {18185#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {18201#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {18201#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {17963#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {18201#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-18 22:16:37,393 INFO L256 TraceCheckUtils]: 6: Hoare triple {17963#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {17963#true} is VALID [2018-11-18 22:16:37,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {17963#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {17963#true} is VALID [2018-11-18 22:16:37,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {17963#true} call #t~ret20 := main(); {17963#true} is VALID [2018-11-18 22:16:37,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17963#true} {17963#true} #129#return; {17963#true} is VALID [2018-11-18 22:16:37,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {17963#true} assume true; {17963#true} is VALID [2018-11-18 22:16:37,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {17963#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {17963#true} is VALID [2018-11-18 22:16:37,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {17963#true} call ULTIMATE.init(); {17963#true} is VALID [2018-11-18 22:16:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:37,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:37,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-18 22:16:37,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-18 22:16:37,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:37,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:16:38,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:38,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:16:38,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:16:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:16:38,182 INFO L87 Difference]: Start difference. First operand 732 states and 939 transitions. Second operand 17 states. [2018-11-18 22:16:52,321 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-18 22:16:53,473 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-18 22:17:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:17:09,974 INFO L93 Difference]: Finished difference Result 2345 states and 3025 transitions. [2018-11-18 22:17:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:17:09,974 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-18 22:17:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:17:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:17:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 581 transitions. [2018-11-18 22:17:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:17:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 581 transitions. [2018-11-18 22:17:09,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 581 transitions. [2018-11-18 22:17:17,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:17:17,674 INFO L225 Difference]: With dead ends: 2345 [2018-11-18 22:17:17,674 INFO L226 Difference]: Without dead ends: 2343 [2018-11-18 22:17:17,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:17:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2018-11-18 22:17:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 870. [2018-11-18 22:17:18,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:17:18,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2343 states. Second operand 870 states. [2018-11-18 22:17:18,578 INFO L74 IsIncluded]: Start isIncluded. First operand 2343 states. Second operand 870 states. [2018-11-18 22:17:18,578 INFO L87 Difference]: Start difference. First operand 2343 states. Second operand 870 states. [2018-11-18 22:17:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:17:18,829 INFO L93 Difference]: Finished difference Result 2343 states and 3023 transitions. [2018-11-18 22:17:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3023 transitions. [2018-11-18 22:17:18,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:17:18,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:17:18,872 INFO L74 IsIncluded]: Start isIncluded. First operand 870 states. Second operand 2343 states. [2018-11-18 22:17:18,873 INFO L87 Difference]: Start difference. First operand 870 states. Second operand 2343 states. [2018-11-18 22:17:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:17:19,070 INFO L93 Difference]: Finished difference Result 2343 states and 3023 transitions. [2018-11-18 22:17:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3023 transitions. [2018-11-18 22:17:19,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:17:19,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:17:19,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:17:19,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:17:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-18 22:17:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1125 transitions. [2018-11-18 22:17:19,109 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1125 transitions. Word has length 42 [2018-11-18 22:17:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:17:19,110 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1125 transitions. [2018-11-18 22:17:19,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:17:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1125 transitions. [2018-11-18 22:17:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:17:19,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:17:19,111 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:17:19,111 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:17:19,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:17:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash -409400409, now seen corresponding path program 1 times [2018-11-18 22:17:19,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:17:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:17:19,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:17:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:17:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:17:19,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:17:19,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {26641#true} call ULTIMATE.init(); {26641#true} is VALID [2018-11-18 22:17:19,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {26641#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26641#true} is VALID [2018-11-18 22:17:19,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {26641#true} assume true; {26641#true} is VALID [2018-11-18 22:17:19,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26641#true} {26641#true} #129#return; {26641#true} is VALID [2018-11-18 22:17:19,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {26641#true} call #t~ret20 := main(); {26641#true} is VALID [2018-11-18 22:17:19,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {26641#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {26641#true} is VALID [2018-11-18 22:17:19,405 INFO L256 TraceCheckUtils]: 6: Hoare triple {26641#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {26641#true} is VALID [2018-11-18 22:17:19,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {26641#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {26667#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:17:19,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {26667#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {26667#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-18 22:17:19,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {26667#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {26674#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:17:19,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~switch3; {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:17:19,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:17:19,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:17:19,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-18 22:17:19,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {26690#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume true; {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,443 INFO L273 TraceCheckUtils]: 26: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-18 22:17:19,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {26706#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} ~j~0 := ~bvsub32(~i~0, 1bv32); {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume true; {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := #t~short12; {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,450 INFO L273 TraceCheckUtils]: 35: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {26731#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {26759#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {26759#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {26759#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-18 22:17:19,453 INFO L256 TraceCheckUtils]: 38: Hoare triple {26759#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {26766#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:17:19,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {26766#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {26770#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:17:19,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {26770#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {26642#false} is VALID [2018-11-18 22:17:19,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {26642#false} assume !false; {26642#false} is VALID [2018-11-18 22:17:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:17:19,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:17:19,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {26642#false} assume !false; {26642#false} is VALID [2018-11-18 22:17:19,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {26780#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {26642#false} is VALID [2018-11-18 22:17:19,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {26784#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {26780#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:17:19,991 INFO L256 TraceCheckUtils]: 38: Hoare triple {26788#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {26784#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:17:19,992 INFO L273 TraceCheckUtils]: 37: Hoare triple {26788#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume ~bvsle32(~start~0, ~j~0);call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~bvadd32(~str.offset, ~start~0), ~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)));havoc #t~ret18.base, #t~ret18.offset; {26788#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {26788#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #t~short16 := ~bvslt32(0bv32, ~j~0); {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~short13;havoc #t~short12;havoc #t~mem10;havoc #t~short13;havoc #t~mem11; {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #t~short13 := #t~short12; {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume true; {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} ~j~0 := ~bvsub32(~i~0, 1bv32); {26795#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,202 INFO L273 TraceCheckUtils]: 24: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,202 INFO L273 TraceCheckUtils]: 23: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} assume true; {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} assume #t~switch3; {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {26823#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~switch3; {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {26848#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~switch3; {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {26880#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume true;#t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1;call #t~mem2 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32);#t~switch3 := 0bv32 == ~sign_extendFrom8To32(#t~mem2); {26864#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {26880#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {26880#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {26641#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0bv32;~i~0 := 4294967295bv32;~j~0 := 4294967295bv32;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2bv32); {26880#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-18 22:17:20,655 INFO L256 TraceCheckUtils]: 6: Hoare triple {26641#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {26641#true} is VALID [2018-11-18 22:17:20,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {26641#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {26641#true} is VALID [2018-11-18 22:17:20,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {26641#true} call #t~ret20 := main(); {26641#true} is VALID [2018-11-18 22:17:20,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26641#true} {26641#true} #129#return; {26641#true} is VALID [2018-11-18 22:17:20,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {26641#true} assume true; {26641#true} is VALID [2018-11-18 22:17:20,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {26641#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26641#true} is VALID [2018-11-18 22:17:20,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {26641#true} call ULTIMATE.init(); {26641#true} is VALID [2018-11-18 22:17:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:17:20,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:17:20,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-18 22:17:20,661 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-11-18 22:17:20,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:17:20,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:17:21,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:17:21,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:17:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:17:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:17:21,389 INFO L87 Difference]: Start difference. First operand 870 states and 1125 transitions. Second operand 18 states. [2018-11-18 22:17:22,638 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-18 22:17:25,287 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-18 22:17:35,768 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-18 22:17:37,204 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-18 22:18:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:18:04,743 INFO L93 Difference]: Finished difference Result 2856 states and 3697 transitions. [2018-11-18 22:18:04,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 22:18:04,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-11-18 22:18:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:18:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:18:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 758 transitions. [2018-11-18 22:18:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:18:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 758 transitions. [2018-11-18 22:18:04,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 758 transitions. [2018-11-18 22:18:19,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 758 edges. 758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:18:20,252 INFO L225 Difference]: With dead ends: 2856 [2018-11-18 22:18:20,253 INFO L226 Difference]: Without dead ends: 2854 [2018-11-18 22:18:20,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=360, Invalid=1710, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 22:18:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2018-11-18 22:18:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 1068. [2018-11-18 22:18:21,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:18:21,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2854 states. Second operand 1068 states. [2018-11-18 22:18:21,595 INFO L74 IsIncluded]: Start isIncluded. First operand 2854 states. Second operand 1068 states. [2018-11-18 22:18:21,595 INFO L87 Difference]: Start difference. First operand 2854 states. Second operand 1068 states. [2018-11-18 22:18:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:18:21,889 INFO L93 Difference]: Finished difference Result 2854 states and 3695 transitions. [2018-11-18 22:18:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3695 transitions. [2018-11-18 22:18:21,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:18:21,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:18:21,894 INFO L74 IsIncluded]: Start isIncluded. First operand 1068 states. Second operand 2854 states. [2018-11-18 22:18:21,894 INFO L87 Difference]: Start difference. First operand 1068 states. Second operand 2854 states. [2018-11-18 22:18:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:18:22,213 INFO L93 Difference]: Finished difference Result 2854 states and 3695 transitions. [2018-11-18 22:18:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3695 transitions. [2018-11-18 22:18:22,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:18:22,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:18:22,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:18:22,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:18:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-11-18 22:18:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1391 transitions. [2018-11-18 22:18:22,261 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1391 transitions. Word has length 42 [2018-11-18 22:18:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:18:22,261 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1391 transitions. [2018-11-18 22:18:22,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:18:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1391 transitions. [2018-11-18 22:18:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:18:22,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:18:22,262 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:18:22,262 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:18:22,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:18:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash -352142107, now seen corresponding path program 1 times [2018-11-18 22:18:22,263 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:18:22,263 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:18:22,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:18:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 22:18:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 22:18:22,511 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 22:18:22,583 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,585 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,586 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,593 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,594 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,594 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,595 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: parse_expression_listENTRY has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-18 22:18:22,613 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-18 22:18:22,614 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2018-11-18 22:18:22,619 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-18 22:18:22,620 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L56-7 has no Hoare annotation [2018-11-18 22:18:22,621 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L56-4 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L56-4 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2018-11-18 22:18:22,622 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2018-11-18 22:18:22,623 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2018-11-18 22:18:22,623 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2018-11-18 22:18:22,623 WARN L170 areAnnotationChecker]: L59-10 has no Hoare annotation [2018-11-18 22:18:22,623 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2018-11-18 22:18:22,623 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L59-7 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L59-7 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2018-11-18 22:18:22,624 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2018-11-18 22:18:22,625 WARN L170 areAnnotationChecker]: L59-5 has no Hoare annotation [2018-11-18 22:18:22,625 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2018-11-18 22:18:22,625 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2018-11-18 22:18:22,625 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-11-18 22:18:22,625 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2018-11-18 22:18:22,625 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:18:22,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:18:22 BoogieIcfgContainer [2018-11-18 22:18:22,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:18:22,629 INFO L168 Benchmark]: Toolchain (without parser) took 192820.35 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -540.8 MB). Peak memory consumption was 487.3 MB. Max. memory is 7.1 GB. [2018-11-18 22:18:22,630 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 22:18:22,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 22:18:22,631 INFO L168 Benchmark]: Boogie Preprocessor took 130.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-18 22:18:22,632 INFO L168 Benchmark]: RCFGBuilder took 1092.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:18:22,632 INFO L168 Benchmark]: TraceAbstraction took 191115.55 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 299.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 197.9 MB). Peak memory consumption was 497.3 MB. Max. memory is 7.1 GB. [2018-11-18 22:18:22,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 477.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1092.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191115.55 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 299.4 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 197.9 MB). Peak memory consumption was 497.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L75] FCALL char A [2 + 2 + 4 +1]; [L76] FCALL A[2 + 2 + 4] = 0 VAL [A={2:0}] [L77] CALL parse_expression_list (A) VAL [str={2:0}] [L49] int start=0, i=-1, j=-1; [L50] FCALL char str2[2]; VAL [i=-1, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}] [L51] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}] [L53] i++ [L54] FCALL str[i] [L55] case 0: VAL [i=0, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=1] [L70] EXPR, FCALL str[i] VAL [i=0, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=1] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] FCALL str[i] [L55] case 0: VAL [i=1, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=1] [L70] EXPR, FCALL str[i] VAL [i=1, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=1] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] FCALL str[i] [L55] case 0: VAL [i=2, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0] [L56] EXPR, FCALL str[start] [L56] (str[start] == ' ') || (str[start] == '\t') [L56] EXPR, FCALL str[start] [L56] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0, str[start]=1, str[start]=1] [L56] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L57] EXPR, FCALL str[start] VAL [i=2, j=-1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0, str[start]=1] [L57] COND FALSE !(str[start] == '"') [L58] j = i-1 VAL [i=2, j=1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L59] EXPR, FCALL str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') [L59] EXPR, FCALL str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0, str[j]=1, str[j]=1] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0, str[j]=1, str[j]=1] [L59] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L60] (0 < j) && (str[j] == '"') [L60] EXPR, FCALL str[j] [L60] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={2:0}, str={2:0}, str2={3:0}, str[i]=0, str[j]=1] [L60] COND FALSE !((0 < j) && (str[j] == '"')) [L61] COND TRUE start<=j [L62] FCALL r_strncpy(str2, str+start, j-start+1) [L63] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 1 error locations. UNSAFE Result, 191.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 171.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 985 SDtfs, 4807 SDslu, 5675 SDs, 0 SdLazy, 4933 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 882 GetRequests, 630 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1795 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 4922 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 117668 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1172 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 0/88 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...