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/AutomizerCInline_WitnessPrinter.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-61f4311 [2018-11-23 11:24:42,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:42,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:42,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:42,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:42,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:42,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:42,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:42,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:42,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:42,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:42,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:42,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:42,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:42,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:42,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:42,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:42,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:42,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:42,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:42,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:42,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:42,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:42,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:42,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:42,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:42,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:42,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:42,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:42,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:42,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:42,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:42,396 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:42,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:42,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:42,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:42,400 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-23 11:24:42,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:42,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:42,431 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:42,431 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:42,432 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:42,433 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:42,433 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:42,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:42,433 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:42,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:42,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:42,434 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:42,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:42,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:42,434 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:42,436 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:42,436 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:42,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:42,436 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:42,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:42,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:42,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:42,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:42,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:42,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:42,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:42,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:42,440 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:42,441 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:42,441 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:42,441 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:42,441 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:42,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:42,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:42,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:42,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:42,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:42,505 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:42,506 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-23 11:24:42,568 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bdf44ea/7e895592be5e40da8b4c122c3fab5da3/FLAG617a946a1 [2018-11-23 11:24:43,034 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:43,034 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 11:24:43,042 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bdf44ea/7e895592be5e40da8b4c122c3fab5da3/FLAG617a946a1 [2018-11-23 11:24:43,383 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bdf44ea/7e895592be5e40da8b4c122c3fab5da3 [2018-11-23 11:24:43,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:43,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:43,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:43,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:43,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:43,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc39dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43, skipping insertion in model container [2018-11-23 11:24:43,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:43,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:43,755 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:43,777 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:43,828 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:43,858 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:43,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43 WrapperNode [2018-11-23 11:24:43,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:43,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:43,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:43,860 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:43,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:43,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:43,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:43,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:43,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:43,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:44,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:44,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (1/1) ... [2018-11-23 11:24:44,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:44,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:44,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:44,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:44,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (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-23 11:24:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-23 11:24:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:24:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-23 11:24:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-23 11:24:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:24:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:44,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:24:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:24:45,058 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:45,058 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:24:45,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:45 BoogieIcfgContainer [2018-11-23 11:24:45,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:45,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:45,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:45,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:45,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:43" (1/3) ... [2018-11-23 11:24:45,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756fa992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:45, skipping insertion in model container [2018-11-23 11:24:45,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:43" (2/3) ... [2018-11-23 11:24:45,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756fa992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:45, skipping insertion in model container [2018-11-23 11:24:45,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:45" (3/3) ... [2018-11-23 11:24:45,068 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 11:24:45,079 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:45,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:45,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:45,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:45,141 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:45,141 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:45,142 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:45,142 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:45,142 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:45,142 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:45,143 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:45,143 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-23 11:24:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:24:45,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:45,171 INFO L402 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-23 11:24:45,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:45,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 526401824, now seen corresponding path program 1 times [2018-11-23 11:24:45,185 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:45,186 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-23 11:24:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:45,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:45,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2018-11-23 11:24:45,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {49#true} is VALID [2018-11-23 11:24:45,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-23 11:24:45,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #125#return; {49#true} is VALID [2018-11-23 11:24:45,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret20 := main(); {49#true} is VALID [2018-11-23 11:24:45,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {49#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {49#true} is VALID [2018-11-23 11:24:45,410 INFO L256 TraceCheckUtils]: 6: Hoare triple {49#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {49#true} is VALID [2018-11-23 11:24:45,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#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); {49#true} is VALID [2018-11-23 11:24:45,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {49#true} is VALID [2018-11-23 11:24:45,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#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); {49#true} is VALID [2018-11-23 11:24:45,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#true} assume #t~switch3; {49#true} is VALID [2018-11-23 11:24:45,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#true} assume !true; {50#false} is VALID [2018-11-23 11:24:45,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {50#false} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {50#false} is VALID [2018-11-23 11:24:45,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {50#false} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {50#false} is VALID [2018-11-23 11:24:45,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {50#false} ~j~0 := ~bvsub32(~i~0, 1bv32); {50#false} is VALID [2018-11-23 11:24:45,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-23 11:24:45,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {50#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {50#false} is VALID [2018-11-23 11:24:45,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {50#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {50#false} is VALID [2018-11-23 11:24:45,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {50#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {50#false} is VALID [2018-11-23 11:24:45,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {50#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; {50#false} is VALID [2018-11-23 11:24:45,416 INFO L256 TraceCheckUtils]: 20: Hoare triple {50#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {50#false} is VALID [2018-11-23 11:24:45,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {50#false} ~cond := #in~cond; {50#false} is VALID [2018-11-23 11:24:45,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {50#false} assume 0bv32 == ~cond; {50#false} is VALID [2018-11-23 11:24:45,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {50#false} assume !false; {50#false} is VALID [2018-11-23 11:24:45,422 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-23 11:24:45,422 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:45,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:45,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:24:45,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:24:45,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:45,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:24:45,515 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-23 11:24:45,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:24:45,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:24:45,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:45,529 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-23 11:24:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:45,741 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2018-11-23 11:24:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:24:45,742 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 11:24:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:24:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:24:45,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 113 transitions. [2018-11-23 11:24:46,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:46,280 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:24:46,281 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 11:24:46,285 INFO L631 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-23 11:24:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 11:24:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 11:24:46,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:46,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 11:24:46,467 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:24:46,468 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:24:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:46,474 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 11:24:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 11:24:46,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:46,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:46,475 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 11:24:46,475 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 11:24:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:46,481 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 11:24:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 11:24:46,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:46,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:46,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:46,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:24:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-11-23 11:24:46,489 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2018-11-23 11:24:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:46,490 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-23 11:24:46,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:24:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 11:24:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:24:46,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:46,494 INFO L402 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] [2018-11-23 11:24:46,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:46,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 269462985, now seen corresponding path program 1 times [2018-11-23 11:24:46,496 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:46,496 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-23 11:24:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:46,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:46,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 11:24:46,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {346#true} is VALID [2018-11-23 11:24:46,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 11:24:46,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #125#return; {346#true} is VALID [2018-11-23 11:24:46,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {346#true} call #t~ret20 := main(); {346#true} is VALID [2018-11-23 11:24:46,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {346#true} is VALID [2018-11-23 11:24:46,819 INFO L256 TraceCheckUtils]: 6: Hoare triple {346#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {346#true} is VALID [2018-11-23 11:24:46,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {346#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); {346#true} is VALID [2018-11-23 11:24:46,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {346#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {346#true} is VALID [2018-11-23 11:24:46,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {346#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); {346#true} is VALID [2018-11-23 11:24:46,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {346#true} assume #t~switch3; {346#true} is VALID [2018-11-23 11:24:46,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {346#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {346#true} is VALID [2018-11-23 11:24:46,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {346#true} assume #t~short6; {387#|parse_expression_list_#t~short6|} is VALID [2018-11-23 11:24:46,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {387#|parse_expression_list_#t~short6|} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {347#false} is VALID [2018-11-23 11:24:46,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {347#false} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {347#false} is VALID [2018-11-23 11:24:46,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {347#false} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {347#false} is VALID [2018-11-23 11:24:46,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {347#false} ~j~0 := ~bvsub32(~i~0, 1bv32); {347#false} is VALID [2018-11-23 11:24:46,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {347#false} #t~short13 := ~bvslt32(0bv32, ~j~0); {347#false} is VALID [2018-11-23 11:24:46,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {347#false} assume !#t~short13; {347#false} is VALID [2018-11-23 11:24:46,852 INFO L273 TraceCheckUtils]: 19: Hoare triple {347#false} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {347#false} is VALID [2018-11-23 11:24:46,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {347#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {347#false} is VALID [2018-11-23 11:24:46,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {347#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {347#false} is VALID [2018-11-23 11:24:46,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {347#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {347#false} is VALID [2018-11-23 11:24:46,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {347#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; {347#false} is VALID [2018-11-23 11:24:46,853 INFO L256 TraceCheckUtils]: 24: Hoare triple {347#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {347#false} is VALID [2018-11-23 11:24:46,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 11:24:46,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {347#false} assume 0bv32 == ~cond; {347#false} is VALID [2018-11-23 11:24:46,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 11:24:46,856 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-23 11:24:46,856 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:46,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:46,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:24:46,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 11:24:46,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:46,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:24:46,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:46,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:24:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:24:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:24:46,965 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 3 states. [2018-11-23 11:24:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:47,269 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2018-11-23 11:24:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:24:47,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 11:24:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:24:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 11:24:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:24:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 11:24:47,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 11:24:47,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:47,633 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:24:47,633 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:24:47,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-23 11:24:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:24:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 11:24:47,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:47,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 11:24:47,650 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 11:24:47,650 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 11:24:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:47,653 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 11:24:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 11:24:47,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:47,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:47,657 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 11:24:47,657 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 11:24:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:47,665 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 11:24:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 11:24:47,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:47,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:47,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:47,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:24:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 11:24:47,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 28 [2018-11-23 11:24:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:47,676 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 11:24:47,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:24:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 11:24:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:24:47,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:47,681 INFO L402 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] [2018-11-23 11:24:47,681 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:47,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash -751605369, now seen corresponding path program 1 times [2018-11-23 11:24:47,683 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:47,683 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-23 11:24:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:47,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:47,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 11:24:47,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {644#true} is VALID [2018-11-23 11:24:47,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 11:24:47,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #125#return; {644#true} is VALID [2018-11-23 11:24:47,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret20 := main(); {644#true} is VALID [2018-11-23 11:24:47,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {644#true} is VALID [2018-11-23 11:24:47,962 INFO L256 TraceCheckUtils]: 6: Hoare triple {644#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {644#true} is VALID [2018-11-23 11:24:47,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {644#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); {644#true} is VALID [2018-11-23 11:24:47,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {644#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {644#true} is VALID [2018-11-23 11:24:47,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {644#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); {644#true} is VALID [2018-11-23 11:24:47,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {644#true} assume #t~switch3; {644#true} is VALID [2018-11-23 11:24:47,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {644#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {644#true} is VALID [2018-11-23 11:24:47,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {644#true} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {644#true} is VALID [2018-11-23 11:24:47,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {644#true} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {644#true} is VALID [2018-11-23 11:24:47,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {644#true} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {644#true} is VALID [2018-11-23 11:24:47,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {644#true} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {644#true} is VALID [2018-11-23 11:24:47,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {644#true} ~j~0 := ~bvsub32(~i~0, 1bv32); {644#true} is VALID [2018-11-23 11:24:47,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {644#true} #t~short13 := ~bvslt32(0bv32, ~j~0); {700#(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-23 11:24:47,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {700#(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; {704#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:47,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {704#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {704#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:47,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {704#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {711#(not |parse_expression_list_#t~short16|)} is VALID [2018-11-23 11:24:47,986 INFO L273 TraceCheckUtils]: 21: Hoare triple {711#(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); {645#false} is VALID [2018-11-23 11:24:47,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {645#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {645#false} is VALID [2018-11-23 11:24:47,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {645#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; {645#false} is VALID [2018-11-23 11:24:47,987 INFO L256 TraceCheckUtils]: 24: Hoare triple {645#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {645#false} is VALID [2018-11-23 11:24:47,987 INFO L273 TraceCheckUtils]: 25: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2018-11-23 11:24:47,987 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#false} assume 0bv32 == ~cond; {645#false} is VALID [2018-11-23 11:24:47,987 INFO L273 TraceCheckUtils]: 27: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 11:24:47,989 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-23 11:24:47,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:47,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:47,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:24:47,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:24:47,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:47,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:24:48,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:48,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:24:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:24:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:24:48,135 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 5 states. [2018-11-23 11:24:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:48,892 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2018-11-23 11:24:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:24:48,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:24:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 11:24:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 11:24:48,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-23 11:24:49,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:49,122 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:24:49,122 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:24:49,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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-23 11:24:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:24:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-11-23 11:24:49,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:49,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 43 states. [2018-11-23 11:24:49,155 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 43 states. [2018-11-23 11:24:49,155 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 43 states. [2018-11-23 11:24:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:49,159 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 11:24:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 11:24:49,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:49,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:49,160 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 60 states. [2018-11-23 11:24:49,161 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 60 states. [2018-11-23 11:24:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:49,165 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 11:24:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 11:24:49,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:49,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:49,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:49,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:24:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 11:24:49,169 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2018-11-23 11:24:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:49,169 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 11:24:49,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:24:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 11:24:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:24:49,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:49,171 INFO L402 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] [2018-11-23 11:24:49,171 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:49,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1080660295, now seen corresponding path program 1 times [2018-11-23 11:24:49,172 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:49,172 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-23 11:24:49,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:49,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:49,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {1019#true} call ULTIMATE.init(); {1019#true} is VALID [2018-11-23 11:24:49,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {1019#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1019#true} is VALID [2018-11-23 11:24:49,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {1019#true} assume true; {1019#true} is VALID [2018-11-23 11:24:49,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1019#true} {1019#true} #125#return; {1019#true} is VALID [2018-11-23 11:24:49,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {1019#true} call #t~ret20 := main(); {1019#true} is VALID [2018-11-23 11:24:49,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {1019#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {1019#true} is VALID [2018-11-23 11:24:49,455 INFO L256 TraceCheckUtils]: 6: Hoare triple {1019#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1019#true} is VALID [2018-11-23 11:24:49,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {1019#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); {1045#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:49,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {1045#(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); {1045#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:49,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {1045#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:49,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:49,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {1052#(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); {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:49,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {1052#(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); {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:49,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {1052#(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; {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:49,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {1052#(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); {1052#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:49,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {1052#(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; {1071#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:49,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {1071#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {1075#(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-23 11:24:49,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {1075#(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); {1075#(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-23 11:24:49,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {1075#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13; {1075#(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-23 11:24:49,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {1075#(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~short13;havoc #t~mem10;havoc #t~mem11; {1075#(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-23 11:24:49,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {1075#(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); {1075#(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-23 11:24:49,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {1075#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16; {1075#(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-23 11:24:49,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {1075#(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; {1075#(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-23 11:24:49,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {1075#(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; {1020#false} is VALID [2018-11-23 11:24:49,541 INFO L256 TraceCheckUtils]: 24: Hoare triple {1020#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {1020#false} is VALID [2018-11-23 11:24:49,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {1020#false} ~cond := #in~cond; {1020#false} is VALID [2018-11-23 11:24:49,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {1020#false} assume 0bv32 == ~cond; {1020#false} is VALID [2018-11-23 11:24:49,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2018-11-23 11:24:49,546 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-23 11:24:49,546 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:49,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:49,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:24:49,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:24:49,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:49,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:24:49,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:49,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:24:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:24:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:24:49,609 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 6 states. [2018-11-23 11:24:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:50,784 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2018-11-23 11:24:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:24:50,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:24:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2018-11-23 11:24:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2018-11-23 11:24:50,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 164 transitions. [2018-11-23 11:24:51,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:51,127 INFO L225 Difference]: With dead ends: 146 [2018-11-23 11:24:51,128 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:24:51,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:24:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:24:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 65. [2018-11-23 11:24:51,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:51,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 65 states. [2018-11-23 11:24:51,212 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 65 states. [2018-11-23 11:24:51,212 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 65 states. [2018-11-23 11:24:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:51,217 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2018-11-23 11:24:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2018-11-23 11:24:51,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:51,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:51,219 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 107 states. [2018-11-23 11:24:51,219 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 107 states. [2018-11-23 11:24:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:51,225 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2018-11-23 11:24:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2018-11-23 11:24:51,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:51,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:51,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:51,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:24:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2018-11-23 11:24:51,229 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 28 [2018-11-23 11:24:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:51,230 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2018-11-23 11:24:51,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:24:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2018-11-23 11:24:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:24:51,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:51,231 INFO L402 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] [2018-11-23 11:24:51,232 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:51,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 493854281, now seen corresponding path program 1 times [2018-11-23 11:24:51,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:51,232 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-23 11:24:51,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:51,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:51,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2018-11-23 11:24:51,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {1576#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1576#true} is VALID [2018-11-23 11:24:51,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2018-11-23 11:24:51,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #125#return; {1576#true} is VALID [2018-11-23 11:24:51,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret20 := main(); {1576#true} is VALID [2018-11-23 11:24:51,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {1576#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {1576#true} is VALID [2018-11-23 11:24:51,477 INFO L256 TraceCheckUtils]: 6: Hoare triple {1576#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1576#true} is VALID [2018-11-23 11:24:51,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {1576#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); {1602#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {1602#(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); {1602#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {1609#(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); {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {1609#(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); {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {1609#(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; {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {1609#(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); {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:51,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {1609#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} ~j~0 := ~bvsub32(~i~0, 1bv32); {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short13 := ~bvslt32(0bv32, ~j~0); {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13; {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {1631#(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~short13;havoc #t~mem10;havoc #t~mem11; {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short16 := ~bvslt32(0bv32, ~j~0); {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16; {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {1631#(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; {1631#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:51,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {1631#(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; {1577#false} is VALID [2018-11-23 11:24:51,518 INFO L256 TraceCheckUtils]: 24: Hoare triple {1577#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {1577#false} is VALID [2018-11-23 11:24:51,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {1577#false} ~cond := #in~cond; {1577#false} is VALID [2018-11-23 11:24:51,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {1577#false} assume 0bv32 == ~cond; {1577#false} is VALID [2018-11-23 11:24:51,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2018-11-23 11:24:51,521 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-23 11:24:51,521 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:51,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:51,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:24:51,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:24:51,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:51,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:24:51,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:51,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:24:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:24:51,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:24:51,573 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 5 states. [2018-11-23 11:24:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:52,400 INFO L93 Difference]: Finished difference Result 145 states and 187 transitions. [2018-11-23 11:24:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:24:52,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:24:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2018-11-23 11:24:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2018-11-23 11:24:52,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 148 transitions. [2018-11-23 11:24:52,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:52,703 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:24:52,703 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:24:52,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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-23 11:24:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:24:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 65. [2018-11-23 11:24:52,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:52,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 65 states. [2018-11-23 11:24:52,745 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 65 states. [2018-11-23 11:24:52,745 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 65 states. [2018-11-23 11:24:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:52,751 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2018-11-23 11:24:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2018-11-23 11:24:52,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:52,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:52,752 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 106 states. [2018-11-23 11:24:52,752 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 106 states. [2018-11-23 11:24:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:52,757 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2018-11-23 11:24:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2018-11-23 11:24:52,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:52,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:52,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:52,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:24:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2018-11-23 11:24:52,761 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 28 [2018-11-23 11:24:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:52,762 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2018-11-23 11:24:52,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:24:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2018-11-23 11:24:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:24:52,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:52,763 INFO L402 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-23 11:24:52,763 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:52,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1633095540, now seen corresponding path program 1 times [2018-11-23 11:24:52,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:52,764 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-23 11:24:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:52,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:52,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {2131#true} call ULTIMATE.init(); {2131#true} is VALID [2018-11-23 11:24:52,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {2131#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2131#true} is VALID [2018-11-23 11:24:52,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {2131#true} assume true; {2131#true} is VALID [2018-11-23 11:24:52,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2131#true} {2131#true} #125#return; {2131#true} is VALID [2018-11-23 11:24:52,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {2131#true} call #t~ret20 := main(); {2131#true} is VALID [2018-11-23 11:24:52,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {2131#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {2131#true} is VALID [2018-11-23 11:24:52,927 INFO L256 TraceCheckUtils]: 6: Hoare triple {2131#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2131#true} is VALID [2018-11-23 11:24:52,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {2131#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); {2131#true} is VALID [2018-11-23 11:24:52,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {2131#true} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {2131#true} is VALID [2018-11-23 11:24:52,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {2131#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); {2131#true} is VALID [2018-11-23 11:24:52,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#true} assume #t~switch3; {2131#true} is VALID [2018-11-23 11:24:52,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {2131#true} call #t~mem4 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 32bv32 == ~sign_extendFrom8To32(#t~mem4); {2131#true} is VALID [2018-11-23 11:24:52,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {2131#true} assume !#t~short6;call #t~mem5 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32);#t~short6 := 9bv32 == ~sign_extendFrom8To32(#t~mem5); {2131#true} is VALID [2018-11-23 11:24:52,929 INFO L273 TraceCheckUtils]: 13: Hoare triple {2131#true} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {2131#true} is VALID [2018-11-23 11:24:52,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {2131#true} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {2131#true} is VALID [2018-11-23 11:24:52,929 INFO L273 TraceCheckUtils]: 15: Hoare triple {2131#true} assume 34bv32 == ~sign_extendFrom8To32(#t~mem8);havoc #t~mem8;#t~post9 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2131#true} is VALID [2018-11-23 11:24:52,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {2131#true} ~j~0 := ~bvsub32(~i~0, 1bv32); {2131#true} is VALID [2018-11-23 11:24:52,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {2131#true} #t~short13 := ~bvslt32(0bv32, ~j~0); {2131#true} is VALID [2018-11-23 11:24:52,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {2131#true} assume #t~short13;call #t~mem10 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 32bv32 == ~sign_extendFrom8To32(#t~mem10); {2131#true} is VALID [2018-11-23 11:24:52,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {2131#true} assume #t~short12; {2193#|parse_expression_list_#t~short12|} is VALID [2018-11-23 11:24:52,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {2193#|parse_expression_list_#t~short12|} #t~short13 := #t~short12; {2197#|parse_expression_list_#t~short13|} is VALID [2018-11-23 11:24:52,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {2197#|parse_expression_list_#t~short13|} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {2132#false} is VALID [2018-11-23 11:24:52,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {2132#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {2132#false} is VALID [2018-11-23 11:24:52,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {2132#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {2132#false} is VALID [2018-11-23 11:24:52,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {2132#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {2132#false} is VALID [2018-11-23 11:24:52,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {2132#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; {2132#false} is VALID [2018-11-23 11:24:52,939 INFO L256 TraceCheckUtils]: 26: Hoare triple {2132#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {2132#false} is VALID [2018-11-23 11:24:52,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {2132#false} ~cond := #in~cond; {2132#false} is VALID [2018-11-23 11:24:52,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {2132#false} assume 0bv32 == ~cond; {2132#false} is VALID [2018-11-23 11:24:52,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {2132#false} assume !false; {2132#false} is VALID [2018-11-23 11:24:52,942 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-23 11:24:52,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:52,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:52,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:24:52,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 11:24:52,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:52,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:24:53,020 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-23 11:24:53,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:24:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:24:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:24:53,021 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 4 states. [2018-11-23 11:24:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:53,304 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2018-11-23 11:24:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:24:53,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 11:24:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:24:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2018-11-23 11:24:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:24:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2018-11-23 11:24:53,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2018-11-23 11:24:53,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:53,444 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:24:53,444 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:24:53,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-23 11:24:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:24:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 11:24:53,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:53,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 11:24:53,476 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 11:24:53,476 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 11:24:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:53,478 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-11-23 11:24:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2018-11-23 11:24:53,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:53,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:53,479 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 11:24:53,479 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 11:24:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:53,482 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-11-23 11:24:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2018-11-23 11:24:53,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:53,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:53,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:53,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:24:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2018-11-23 11:24:53,486 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 30 [2018-11-23 11:24:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:53,486 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2018-11-23 11:24:53,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:24:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-23 11:24:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:24:53,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:53,487 INFO L402 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-23 11:24:53,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:53,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -932030962, now seen corresponding path program 1 times [2018-11-23 11:24:53,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:53,488 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-23 11:24:53,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:53,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:53,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2018-11-23 11:24:53,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {2572#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2572#true} is VALID [2018-11-23 11:24:53,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2018-11-23 11:24:53,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #125#return; {2572#true} is VALID [2018-11-23 11:24:53,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret20 := main(); {2572#true} is VALID [2018-11-23 11:24:53,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {2572#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {2572#true} is VALID [2018-11-23 11:24:53,774 INFO L256 TraceCheckUtils]: 6: Hoare triple {2572#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2572#true} is VALID [2018-11-23 11:24:53,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {2572#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); {2598#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:53,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {2598#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {2598#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:53,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {2598#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} #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); {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2605#(= (_ bv0 32) parse_expression_list_~i~0)} assume #t~switch3; {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {2605#(= (_ 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); {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {2605#(= (_ 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); {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {2605#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {2605#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {2605#(= (_ 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; {2605#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:24:53,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {2605#(= (_ bv0 32) parse_expression_list_~i~0)} ~j~0 := ~bvsub32(~i~0, 1bv32); {2627#(= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:53,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {2627#(= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {2631#(not |parse_expression_list_#t~short13|)} is VALID [2018-11-23 11:24:53,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {2631#(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); {2573#false} is VALID [2018-11-23 11:24:53,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#false} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {2573#false} is VALID [2018-11-23 11:24:53,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {2573#false} #t~short13 := #t~short12; {2573#false} is VALID [2018-11-23 11:24:53,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {2573#false} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {2573#false} is VALID [2018-11-23 11:24:53,784 INFO L273 TraceCheckUtils]: 22: Hoare triple {2573#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {2573#false} is VALID [2018-11-23 11:24:53,784 INFO L273 TraceCheckUtils]: 23: Hoare triple {2573#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {2573#false} is VALID [2018-11-23 11:24:53,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {2573#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {2573#false} is VALID [2018-11-23 11:24:53,785 INFO L273 TraceCheckUtils]: 25: Hoare triple {2573#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; {2573#false} is VALID [2018-11-23 11:24:53,785 INFO L256 TraceCheckUtils]: 26: Hoare triple {2573#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {2573#false} is VALID [2018-11-23 11:24:53,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2018-11-23 11:24:53,786 INFO L273 TraceCheckUtils]: 28: Hoare triple {2573#false} assume 0bv32 == ~cond; {2573#false} is VALID [2018-11-23 11:24:53,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2018-11-23 11:24:53,787 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-23 11:24:53,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:53,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:53,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:24:53,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 11:24:53,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:53,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:24:53,830 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-23 11:24:53,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:24:53,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:24:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:24:53,831 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 6 states. [2018-11-23 11:24:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:54,400 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2018-11-23 11:24:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:24:54,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 11:24:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 11:24:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-23 11:24:54,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-23 11:24:54,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:54,583 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:24:54,583 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:24:54,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 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-23 11:24:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:24:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2018-11-23 11:24:54,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:54,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 64 states. [2018-11-23 11:24:54,608 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 64 states. [2018-11-23 11:24:54,609 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 64 states. [2018-11-23 11:24:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:54,613 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 11:24:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-11-23 11:24:54,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:54,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:54,614 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 89 states. [2018-11-23 11:24:54,614 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 89 states. [2018-11-23 11:24:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:54,617 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 11:24:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-11-23 11:24:54,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:54,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:54,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:54,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:24:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2018-11-23 11:24:54,621 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 30 [2018-11-23 11:24:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:54,621 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2018-11-23 11:24:54,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:24:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2018-11-23 11:24:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:24:54,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:54,623 INFO L402 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] [2018-11-23 11:24:54,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:54,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash 479036193, now seen corresponding path program 1 times [2018-11-23 11:24:54,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:54,624 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-23 11:24:54,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:54,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:55,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {3093#true} call ULTIMATE.init(); {3093#true} is VALID [2018-11-23 11:24:55,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {3093#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3093#true} is VALID [2018-11-23 11:24:55,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {3093#true} assume true; {3093#true} is VALID [2018-11-23 11:24:55,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3093#true} {3093#true} #125#return; {3093#true} is VALID [2018-11-23 11:24:55,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {3093#true} call #t~ret20 := main(); {3093#true} is VALID [2018-11-23 11:24:55,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {3093#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {3093#true} is VALID [2018-11-23 11:24:55,037 INFO L256 TraceCheckUtils]: 6: Hoare triple {3093#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3093#true} is VALID [2018-11-23 11:24:55,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {3093#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); {3119#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(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); {3119#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {3119#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {3126#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:55,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {3126#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {3126#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:55,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {3126#(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); {3126#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:55,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {3126#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~short6; {3126#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:55,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {3126#(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; {3139#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {3139#(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); {3139#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {3139#(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); {3139#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {3139#(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; {3139#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {3139#(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); {3139#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {3139#(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; {3155#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {3155#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (_ bv0 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short13 := ~bvslt32(0bv32, ~j~0); {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short13; {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {3159#(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~short13;havoc #t~mem10;havoc #t~mem11; {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} #t~short16 := ~bvslt32(0bv32, ~j~0); {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,063 INFO L273 TraceCheckUtils]: 24: Hoare triple {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} assume !#t~short16; {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,065 INFO L273 TraceCheckUtils]: 25: Hoare triple {3159#(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; {3159#(and (= (_ bv2 32) parse_expression_list_~start~0) (= (bvadd parse_expression_list_~j~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:55,065 INFO L273 TraceCheckUtils]: 26: Hoare triple {3159#(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; {3094#false} is VALID [2018-11-23 11:24:55,065 INFO L256 TraceCheckUtils]: 27: Hoare triple {3094#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {3094#false} is VALID [2018-11-23 11:24:55,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {3094#false} ~cond := #in~cond; {3094#false} is VALID [2018-11-23 11:24:55,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {3094#false} assume 0bv32 == ~cond; {3094#false} is VALID [2018-11-23 11:24:55,066 INFO L273 TraceCheckUtils]: 30: Hoare triple {3094#false} assume !false; {3094#false} is VALID [2018-11-23 11:24:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:55,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:24:55,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {3094#false} assume !false; {3094#false} is VALID [2018-11-23 11:24:55,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {3094#false} assume 0bv32 == ~cond; {3094#false} is VALID [2018-11-23 11:24:55,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {3094#false} ~cond := #in~cond; {3094#false} is VALID [2018-11-23 11:24:55,311 INFO L256 TraceCheckUtils]: 27: Hoare triple {3094#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {3094#false} is VALID [2018-11-23 11:24:55,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {3205#(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; {3094#false} is VALID [2018-11-23 11:24:55,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short16; {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short13; {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {3227#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} ~j~0 := ~bvsub32(~i~0, 1bv32); {3205#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:24:55,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {3231#(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; {3227#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {3231#(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); {3231#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {3231#(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; {3231#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {3231#(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); {3231#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {3231#(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); {3231#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {3247#(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; {3231#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {3247#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~short6; {3247#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {3247#(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); {3247#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {3247#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~switch3; {3247#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {3260#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} #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); {3247#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:24:55,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {3260#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {3260#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {3093#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); {3260#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:24:55,376 INFO L256 TraceCheckUtils]: 6: Hoare triple {3093#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3093#true} is VALID [2018-11-23 11:24:55,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {3093#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {3093#true} is VALID [2018-11-23 11:24:55,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {3093#true} call #t~ret20 := main(); {3093#true} is VALID [2018-11-23 11:24:55,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3093#true} {3093#true} #125#return; {3093#true} is VALID [2018-11-23 11:24:55,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {3093#true} assume true; {3093#true} is VALID [2018-11-23 11:24:55,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {3093#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3093#true} is VALID [2018-11-23 11:24:55,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {3093#true} call ULTIMATE.init(); {3093#true} is VALID [2018-11-23 11:24:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:55,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:55,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:24:55,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 11:24:55,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:55,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:24:55,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:55,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:24:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:24:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:24:55,548 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 12 states. [2018-11-23 11:24:56,231 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-23 11:24:57,242 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-11-23 11:25:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:03,014 INFO L93 Difference]: Finished difference Result 339 states and 440 transitions. [2018-11-23 11:25:03,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:25:03,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 11:25:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 338 transitions. [2018-11-23 11:25:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 338 transitions. [2018-11-23 11:25:03,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 338 transitions. [2018-11-23 11:25:04,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:04,329 INFO L225 Difference]: With dead ends: 339 [2018-11-23 11:25:04,329 INFO L226 Difference]: Without dead ends: 263 [2018-11-23 11:25:04,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:25:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-23 11:25:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 119. [2018-11-23 11:25:04,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:04,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand 119 states. [2018-11-23 11:25:04,992 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 119 states. [2018-11-23 11:25:04,993 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 119 states. [2018-11-23 11:25:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:05,009 INFO L93 Difference]: Finished difference Result 263 states and 341 transitions. [2018-11-23 11:25:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 341 transitions. [2018-11-23 11:25:05,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:05,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:05,011 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 263 states. [2018-11-23 11:25:05,011 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 263 states. [2018-11-23 11:25:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:05,023 INFO L93 Difference]: Finished difference Result 263 states and 341 transitions. [2018-11-23 11:25:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 341 transitions. [2018-11-23 11:25:05,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:05,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:05,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:05,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 11:25:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2018-11-23 11:25:05,029 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 31 [2018-11-23 11:25:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:05,030 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2018-11-23 11:25:05,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:25:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2018-11-23 11:25:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:25:05,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:05,031 INFO L402 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] [2018-11-23 11:25:05,031 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:05,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1558791110, now seen corresponding path program 1 times [2018-11-23 11:25:05,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:05,033 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-23 11:25:05,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:05,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:05,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {4379#true} call ULTIMATE.init(); {4379#true} is VALID [2018-11-23 11:25:05,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {4379#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4379#true} is VALID [2018-11-23 11:25:05,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {4379#true} assume true; {4379#true} is VALID [2018-11-23 11:25:05,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4379#true} {4379#true} #125#return; {4379#true} is VALID [2018-11-23 11:25:05,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {4379#true} call #t~ret20 := main(); {4379#true} is VALID [2018-11-23 11:25:05,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {4379#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {4379#true} is VALID [2018-11-23 11:25:05,364 INFO L256 TraceCheckUtils]: 6: Hoare triple {4379#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4379#true} is VALID [2018-11-23 11:25:05,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {4379#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); {4405#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:05,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {4405#(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); {4405#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:05,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {4405#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:05,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:05,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:05,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {4412#(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); {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:05,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:05,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {4412#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} #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); {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume #t~switch3; {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {4428#(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); {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {4428#(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); {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {4428#(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; {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {4428#(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); {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:05,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {4428#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13; {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short16; {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,383 INFO L273 TraceCheckUtils]: 28: Hoare triple {4450#(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; {4450#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:05,384 INFO L256 TraceCheckUtils]: 29: Hoare triple {4450#(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)); {4475#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:05,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {4475#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4479#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:05,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {4479#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4380#false} is VALID [2018-11-23 11:25:05,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {4380#false} assume !false; {4380#false} is VALID [2018-11-23 11:25:05,391 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-23 11:25:05,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:05,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {4380#false} assume !false; {4380#false} is VALID [2018-11-23 11:25:05,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {4489#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4380#false} is VALID [2018-11-23 11:25:05,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {4493#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4489#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:05,684 INFO L256 TraceCheckUtils]: 29: Hoare triple {4497#(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)); {4493#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:05,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {4497#(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; {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {4497#(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; {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short16; {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short16 := ~bvslt32(0bv32, ~j~0); {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {4497#(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~short13;havoc #t~mem10;havoc #t~mem11; {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~short13; {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} ~j~0 := ~bvsub32(~i~0, 1bv32); {4497#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {4522#(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); {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {4522#(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; {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {4522#(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); {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {4522#(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); {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume #t~switch3; {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #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); {4522#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {4544#(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; {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {4544#(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); {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:05,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~switch3; {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:06,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {4560#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} #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); {4544#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:06,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {4560#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {4560#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:06,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {4379#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); {4560#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-23 11:25:06,134 INFO L256 TraceCheckUtils]: 6: Hoare triple {4379#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {4379#true} is VALID [2018-11-23 11:25:06,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {4379#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {4379#true} is VALID [2018-11-23 11:25:06,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {4379#true} call #t~ret20 := main(); {4379#true} is VALID [2018-11-23 11:25:06,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4379#true} {4379#true} #125#return; {4379#true} is VALID [2018-11-23 11:25:06,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {4379#true} assume true; {4379#true} is VALID [2018-11-23 11:25:06,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {4379#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4379#true} is VALID [2018-11-23 11:25:06,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {4379#true} call ULTIMATE.init(); {4379#true} is VALID [2018-11-23 11:25:06,138 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-23 11:25:06,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:06,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:25:06,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:25:06,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:06,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:25:06,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:06,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:25:06,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:25:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:25:06,641 INFO L87 Difference]: Start difference. First operand 119 states and 156 transitions. Second operand 14 states. [2018-11-23 11:25:16,809 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-11-23 11:25:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:22,811 INFO L93 Difference]: Finished difference Result 421 states and 554 transitions. [2018-11-23 11:25:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:25:22,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:25:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:25:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 372 transitions. [2018-11-23 11:25:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:25:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 372 transitions. [2018-11-23 11:25:22,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 372 transitions. [2018-11-23 11:25:27,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:27,372 INFO L225 Difference]: With dead ends: 421 [2018-11-23 11:25:27,372 INFO L226 Difference]: Without dead ends: 419 [2018-11-23 11:25:27,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 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-23 11:25:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-23 11:25:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 166. [2018-11-23 11:25:27,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:27,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand 166 states. [2018-11-23 11:25:27,493 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand 166 states. [2018-11-23 11:25:27,493 INFO L87 Difference]: Start difference. First operand 419 states. Second operand 166 states. [2018-11-23 11:25:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:27,512 INFO L93 Difference]: Finished difference Result 419 states and 552 transitions. [2018-11-23 11:25:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 552 transitions. [2018-11-23 11:25:27,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:27,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:27,514 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 419 states. [2018-11-23 11:25:27,514 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 419 states. [2018-11-23 11:25:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:27,545 INFO L93 Difference]: Finished difference Result 419 states and 552 transitions. [2018-11-23 11:25:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 552 transitions. [2018-11-23 11:25:27,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:27,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:27,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:27,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:25:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 219 transitions. [2018-11-23 11:25:27,561 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 219 transitions. Word has length 33 [2018-11-23 11:25:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:27,562 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 219 transitions. [2018-11-23 11:25:27,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:25:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 219 transitions. [2018-11-23 11:25:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:25:27,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:27,563 INFO L402 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-23 11:25:27,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:27,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:27,564 INFO L82 PathProgramCache]: Analyzing trace with hash 270045259, now seen corresponding path program 1 times [2018-11-23 11:25:27,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:27,565 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-23 11:25:27,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:27,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:28,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {6139#true} call ULTIMATE.init(); {6139#true} is VALID [2018-11-23 11:25:28,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {6139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6139#true} is VALID [2018-11-23 11:25:28,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {6139#true} assume true; {6139#true} is VALID [2018-11-23 11:25:28,077 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6139#true} {6139#true} #125#return; {6139#true} is VALID [2018-11-23 11:25:28,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {6139#true} call #t~ret20 := main(); {6139#true} is VALID [2018-11-23 11:25:28,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {6139#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {6139#true} is VALID [2018-11-23 11:25:28,077 INFO L256 TraceCheckUtils]: 6: Hoare triple {6139#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {6139#true} is VALID [2018-11-23 11:25:28,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {6139#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); {6165#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:28,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {6165#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {6165#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:28,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {6165#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} #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); {6172#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {6172#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~switch3; {6172#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {6172#(= (_ bv0 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {6172#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {6172#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {6172#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {6172#(= (_ bv0 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {6172#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {6172#(= (_ bv0 32) parse_expression_list_~i~0)} #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); {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {6188#(= (_ bv1 32) parse_expression_list_~i~0)} assume #t~switch3; {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {6188#(= (_ 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); {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {6188#(= (_ 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); {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {6188#(= (_ bv1 32) parse_expression_list_~i~0)} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {6188#(= (_ bv1 32) parse_expression_list_~i~0)} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {6188#(= (_ 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; {6188#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:28,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {6188#(= (_ bv1 32) parse_expression_list_~i~0)} ~j~0 := ~bvsub32(~i~0, 1bv32); {6210#(= (_ bv0 32) parse_expression_list_~j~0)} is VALID [2018-11-23 11:25:28,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {6210#(= (_ bv0 32) parse_expression_list_~j~0)} #t~short13 := ~bvslt32(0bv32, ~j~0); {6214#(not |parse_expression_list_#t~short13|)} is VALID [2018-11-23 11:25:28,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {6214#(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); {6140#false} is VALID [2018-11-23 11:25:28,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {6140#false} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {6140#false} is VALID [2018-11-23 11:25:28,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {6140#false} #t~short13 := #t~short12; {6140#false} is VALID [2018-11-23 11:25:28,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {6140#false} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {6140#false} is VALID [2018-11-23 11:25:28,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {6140#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {6140#false} is VALID [2018-11-23 11:25:28,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {6140#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {6140#false} is VALID [2018-11-23 11:25:28,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {6140#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {6140#false} is VALID [2018-11-23 11:25:28,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {6140#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; {6140#false} is VALID [2018-11-23 11:25:28,108 INFO L256 TraceCheckUtils]: 31: Hoare triple {6140#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {6140#false} is VALID [2018-11-23 11:25:28,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {6140#false} ~cond := #in~cond; {6140#false} is VALID [2018-11-23 11:25:28,108 INFO L273 TraceCheckUtils]: 33: Hoare triple {6140#false} assume 0bv32 == ~cond; {6140#false} is VALID [2018-11-23 11:25:28,108 INFO L273 TraceCheckUtils]: 34: Hoare triple {6140#false} assume !false; {6140#false} is VALID [2018-11-23 11:25:28,109 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-23 11:25:28,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:28,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {6140#false} assume !false; {6140#false} is VALID [2018-11-23 11:25:28,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {6140#false} assume 0bv32 == ~cond; {6140#false} is VALID [2018-11-23 11:25:28,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {6140#false} ~cond := #in~cond; {6140#false} is VALID [2018-11-23 11:25:28,213 INFO L256 TraceCheckUtils]: 31: Hoare triple {6140#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {6140#false} is VALID [2018-11-23 11:25:28,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {6140#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; {6140#false} is VALID [2018-11-23 11:25:28,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {6140#false} assume #t~short16;havoc #t~mem15;havoc #t~short16;#t~post17 := ~j~0;~j~0 := ~bvsub32(#t~post17, 1bv32);havoc #t~post17; {6140#false} is VALID [2018-11-23 11:25:28,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {6140#false} assume #t~short16;call #t~mem15 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short16 := 34bv32 == ~sign_extendFrom8To32(#t~mem15); {6140#false} is VALID [2018-11-23 11:25:28,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {6140#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {6140#false} is VALID [2018-11-23 11:25:28,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {6140#false} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {6140#false} is VALID [2018-11-23 11:25:28,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {6140#false} #t~short13 := #t~short12; {6140#false} is VALID [2018-11-23 11:25:28,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {6140#false} assume !#t~short12;call #t~mem11 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~j~0), 1bv32);#t~short12 := 9bv32 == ~sign_extendFrom8To32(#t~mem11); {6140#false} is VALID [2018-11-23 11:25:28,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {6214#(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); {6140#false} is VALID [2018-11-23 11:25:28,223 INFO L273 TraceCheckUtils]: 22: Hoare triple {6287#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {6214#(not |parse_expression_list_#t~short13|)} is VALID [2018-11-23 11:25:28,223 INFO L273 TraceCheckUtils]: 21: Hoare triple {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} ~j~0 := ~bvsub32(~i~0, 1bv32); {6287#(not (bvslt (_ bv0 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:28,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {6291#(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; {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {6291#(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); {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {6291#(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); {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {6291#(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); {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~switch3; {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} #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); {6291#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:28,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:28,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:28,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:28,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} assume !#t~switch3; {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:28,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {6329#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} #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); {6313#(not (bvslt (_ bv0 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:28,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {6329#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {6329#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} is VALID [2018-11-23 11:25:28,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {6139#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); {6329#(not (bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} is VALID [2018-11-23 11:25:28,241 INFO L256 TraceCheckUtils]: 6: Hoare triple {6139#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {6139#true} is VALID [2018-11-23 11:25:28,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {6139#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {6139#true} is VALID [2018-11-23 11:25:28,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {6139#true} call #t~ret20 := main(); {6139#true} is VALID [2018-11-23 11:25:28,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6139#true} {6139#true} #125#return; {6139#true} is VALID [2018-11-23 11:25:28,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {6139#true} assume true; {6139#true} is VALID [2018-11-23 11:25:28,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {6139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6139#true} is VALID [2018-11-23 11:25:28,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {6139#true} call ULTIMATE.init(); {6139#true} is VALID [2018-11-23 11:25:28,243 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-23 11:25:28,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:28,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 11:25:28,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 11:25:28,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:28,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:25:28,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:28,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:25:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:25:28,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:25:28,333 INFO L87 Difference]: Start difference. First operand 166 states and 219 transitions. Second operand 11 states. [2018-11-23 11:25:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:29,934 INFO L93 Difference]: Finished difference Result 346 states and 452 transitions. [2018-11-23 11:25:29,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:25:29,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 11:25:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:25:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2018-11-23 11:25:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:25:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2018-11-23 11:25:29,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 174 transitions. [2018-11-23 11:25:30,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:30,661 INFO L225 Difference]: With dead ends: 346 [2018-11-23 11:25:30,662 INFO L226 Difference]: Without dead ends: 257 [2018-11-23 11:25:30,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 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-23 11:25:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-23 11:25:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 188. [2018-11-23 11:25:30,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:30,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 188 states. [2018-11-23 11:25:30,829 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 188 states. [2018-11-23 11:25:30,829 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 188 states. [2018-11-23 11:25:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:30,836 INFO L93 Difference]: Finished difference Result 257 states and 331 transitions. [2018-11-23 11:25:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 331 transitions. [2018-11-23 11:25:30,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:30,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:30,837 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 257 states. [2018-11-23 11:25:30,838 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 257 states. [2018-11-23 11:25:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:30,845 INFO L93 Difference]: Finished difference Result 257 states and 331 transitions. [2018-11-23 11:25:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 331 transitions. [2018-11-23 11:25:30,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:30,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:30,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:30,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-23 11:25:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2018-11-23 11:25:30,851 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 35 [2018-11-23 11:25:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:30,852 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2018-11-23 11:25:30,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:25:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2018-11-23 11:25:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:25:30,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:30,853 INFO L402 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] [2018-11-23 11:25:30,853 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:30,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1760982887, now seen corresponding path program 1 times [2018-11-23 11:25:30,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:30,854 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-23 11:25:30,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:30,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:31,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {7525#true} call ULTIMATE.init(); {7525#true} is VALID [2018-11-23 11:25:31,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {7525#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7525#true} is VALID [2018-11-23 11:25:31,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {7525#true} assume true; {7525#true} is VALID [2018-11-23 11:25:31,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7525#true} {7525#true} #125#return; {7525#true} is VALID [2018-11-23 11:25:31,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {7525#true} call #t~ret20 := main(); {7525#true} is VALID [2018-11-23 11:25:31,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {7525#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {7525#true} is VALID [2018-11-23 11:25:31,371 INFO L256 TraceCheckUtils]: 6: Hoare triple {7525#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {7525#true} is VALID [2018-11-23 11:25:31,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {7525#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); {7551#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:31,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {7551#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {7551#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:31,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {7551#(= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32))} #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); {7558#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {7558#(= (_ bv0 32) parse_expression_list_~i~0)} assume !#t~switch3; {7558#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {7558#(= (_ bv0 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {7558#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {7558#(= (_ bv0 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {7558#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {7558#(= (_ bv0 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {7558#(= (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {7558#(= (_ bv0 32) parse_expression_list_~i~0)} #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); {7574#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {7574#(= (_ bv1 32) parse_expression_list_~i~0)} assume !#t~switch3; {7574#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {7574#(= (_ bv1 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {7574#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {7574#(= (_ bv1 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {7574#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {7574#(= (_ bv1 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {7574#(= (_ bv1 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {7574#(= (_ bv1 32) parse_expression_list_~i~0)} #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); {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {7590#(= (_ bv2 32) parse_expression_list_~i~0)} assume #t~switch3; {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {7590#(= (_ 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); {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,382 INFO L273 TraceCheckUtils]: 22: Hoare triple {7590#(= (_ 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); {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {7590#(= (_ bv2 32) parse_expression_list_~i~0)} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {7590#(= (_ bv2 32) parse_expression_list_~i~0)} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {7590#(= (_ 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; {7590#(= (_ bv2 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {7590#(= (_ bv2 32) parse_expression_list_~i~0)} ~j~0 := ~bvsub32(~i~0, 1bv32); {7612#(= (_ bv1 32) parse_expression_list_~j~0)} is VALID [2018-11-23 11:25:31,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {7612#(= (_ bv1 32) parse_expression_list_~j~0)} #t~short13 := ~bvslt32(0bv32, ~j~0); {7616#|parse_expression_list_#t~short13|} is VALID [2018-11-23 11:25:31,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {7616#|parse_expression_list_#t~short13|} assume !#t~short13; {7526#false} is VALID [2018-11-23 11:25:31,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {7526#false} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {7526#false} is VALID [2018-11-23 11:25:31,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {7526#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {7526#false} is VALID [2018-11-23 11:25:31,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {7526#false} assume !#t~short16; {7526#false} is VALID [2018-11-23 11:25:31,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {7526#false} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {7526#false} is VALID [2018-11-23 11:25:31,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {7526#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; {7526#false} is VALID [2018-11-23 11:25:31,387 INFO L256 TraceCheckUtils]: 34: Hoare triple {7526#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {7526#false} is VALID [2018-11-23 11:25:31,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {7526#false} ~cond := #in~cond; {7526#false} is VALID [2018-11-23 11:25:31,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {7526#false} assume 0bv32 == ~cond; {7526#false} is VALID [2018-11-23 11:25:31,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {7526#false} assume !false; {7526#false} is VALID [2018-11-23 11:25:31,389 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-23 11:25:31,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:31,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {7526#false} assume !false; {7526#false} is VALID [2018-11-23 11:25:31,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {7526#false} assume 0bv32 == ~cond; {7526#false} is VALID [2018-11-23 11:25:31,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {7526#false} ~cond := #in~cond; {7526#false} is VALID [2018-11-23 11:25:31,601 INFO L256 TraceCheckUtils]: 34: Hoare triple {7526#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {7526#false} is VALID [2018-11-23 11:25:31,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {7526#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; {7526#false} is VALID [2018-11-23 11:25:31,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {7526#false} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {7526#false} is VALID [2018-11-23 11:25:31,601 INFO L273 TraceCheckUtils]: 31: Hoare triple {7526#false} assume !#t~short16; {7526#false} is VALID [2018-11-23 11:25:31,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {7526#false} #t~short16 := ~bvslt32(0bv32, ~j~0); {7526#false} is VALID [2018-11-23 11:25:31,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {7526#false} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {7526#false} is VALID [2018-11-23 11:25:31,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {7616#|parse_expression_list_#t~short13|} assume !#t~short13; {7526#false} is VALID [2018-11-23 11:25:31,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {7677#(bvslt (_ bv0 32) parse_expression_list_~j~0)} #t~short13 := ~bvslt32(0bv32, ~j~0); {7616#|parse_expression_list_#t~short13|} is VALID [2018-11-23 11:25:31,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} ~j~0 := ~bvsub32(~i~0, 1bv32); {7677#(bvslt (_ bv0 32) parse_expression_list_~j~0)} is VALID [2018-11-23 11:25:31,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {7681#(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; {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {7681#(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); {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {7681#(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); {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} assume #t~switch3; {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} #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); {7681#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:25:31,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} havoc #t~mem2;havoc #t~switch3; {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} assume !#t~switch3; {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} #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); {7703#(bvslt (_ bv0 32) parse_expression_list_~i~0)} is VALID [2018-11-23 11:25:31,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-23 11:25:31,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-23 11:25:31,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} havoc #t~mem2;havoc #t~switch3; {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-23 11:25:31,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} assume !#t~switch3; {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-23 11:25:31,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {7735#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} #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); {7719#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv1 32)))} is VALID [2018-11-23 11:25:31,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {7735#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {7735#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:25:31,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {7525#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); {7735#(bvslt (_ bv0 32) (bvadd parse_expression_list_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:25:31,620 INFO L256 TraceCheckUtils]: 6: Hoare triple {7525#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {7525#true} is VALID [2018-11-23 11:25:31,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {7525#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {7525#true} is VALID [2018-11-23 11:25:31,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {7525#true} call #t~ret20 := main(); {7525#true} is VALID [2018-11-23 11:25:31,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7525#true} {7525#true} #125#return; {7525#true} is VALID [2018-11-23 11:25:31,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {7525#true} assume true; {7525#true} is VALID [2018-11-23 11:25:31,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {7525#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7525#true} is VALID [2018-11-23 11:25:31,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {7525#true} call ULTIMATE.init(); {7525#true} is VALID [2018-11-23 11:25:31,623 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-23 11:25:31,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:31,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 11:25:31,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-23 11:25:31,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:31,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:25:31,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:31,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:25:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:25:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:25:31,708 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand 13 states. [2018-11-23 11:25:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:38,694 INFO L93 Difference]: Finished difference Result 820 states and 1089 transitions. [2018-11-23 11:25:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:25:38,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-23 11:25:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:25:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 536 transitions. [2018-11-23 11:25:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:25:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 536 transitions. [2018-11-23 11:25:38,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 536 transitions. [2018-11-23 11:25:40,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:40,146 INFO L225 Difference]: With dead ends: 820 [2018-11-23 11:25:40,146 INFO L226 Difference]: Without dead ends: 750 [2018-11-23 11:25:40,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:25:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-11-23 11:25:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 465. [2018-11-23 11:25:40,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:40,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand 465 states. [2018-11-23 11:25:40,456 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand 465 states. [2018-11-23 11:25:40,456 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 465 states. [2018-11-23 11:25:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:40,491 INFO L93 Difference]: Finished difference Result 750 states and 990 transitions. [2018-11-23 11:25:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 990 transitions. [2018-11-23 11:25:40,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:40,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:40,494 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand 750 states. [2018-11-23 11:25:40,494 INFO L87 Difference]: Start difference. First operand 465 states. Second operand 750 states. [2018-11-23 11:25:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:40,530 INFO L93 Difference]: Finished difference Result 750 states and 990 transitions. [2018-11-23 11:25:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 990 transitions. [2018-11-23 11:25:40,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:40,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:40,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:40,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-23 11:25:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 610 transitions. [2018-11-23 11:25:40,550 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 610 transitions. Word has length 38 [2018-11-23 11:25:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:40,551 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 610 transitions. [2018-11-23 11:25:40,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:25:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 610 transitions. [2018-11-23 11:25:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:25:40,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:40,552 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 11:25:40,553 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:40,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1355800260, now seen corresponding path program 1 times [2018-11-23 11:25:40,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:40,553 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-23 11:25:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:40,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:41,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {10826#true} call ULTIMATE.init(); {10826#true} is VALID [2018-11-23 11:25:41,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {10826#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {10826#true} is VALID [2018-11-23 11:25:41,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {10826#true} assume true; {10826#true} is VALID [2018-11-23 11:25:41,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10826#true} {10826#true} #125#return; {10826#true} is VALID [2018-11-23 11:25:41,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {10826#true} call #t~ret20 := main(); {10826#true} is VALID [2018-11-23 11:25:41,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {10826#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {10826#true} is VALID [2018-11-23 11:25:41,218 INFO L256 TraceCheckUtils]: 6: Hoare triple {10826#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {10826#true} is VALID [2018-11-23 11:25:41,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {10826#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); {10852#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:41,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {10852#(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); {10852#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:41,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {10852#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:41,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:41,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:41,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {10859#(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); {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:41,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:41,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {10859#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} #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); {10875#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {10875#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume #t~switch3; {10875#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {10875#(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); {10875#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {10875#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume #t~short6; {10875#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {10875#(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;#t~post7 := ~start~0;~start~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {10888#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {10888#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ 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); {10888#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {10888#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume #t~short6; {10888#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {10888#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} 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; {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ 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); {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ 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); {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~short6;havoc #t~mem4;havoc #t~mem5;havoc #t~short6; {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} call #t~mem8 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~start~0), 1bv32); {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {10898#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ 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; {10914#(and (= (_ bv1 32) parse_expression_list_~i~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {10914#(and (= (_ bv1 32) parse_expression_list_~i~0) (= (_ bv3 32) parse_expression_list_~start~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,236 INFO L273 TraceCheckUtils]: 29: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} assume !#t~short13; {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} assume !#t~short16; {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~0))} is VALID [2018-11-23 11:25:41,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {10918#(and (= (_ bv0 32) parse_expression_list_~j~0) (= (_ bv3 32) parse_expression_list_~start~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; {10827#false} is VALID [2018-11-23 11:25:41,240 INFO L256 TraceCheckUtils]: 35: Hoare triple {10827#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {10827#false} is VALID [2018-11-23 11:25:41,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {10827#false} ~cond := #in~cond; {10827#false} is VALID [2018-11-23 11:25:41,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {10827#false} assume 0bv32 == ~cond; {10827#false} is VALID [2018-11-23 11:25:41,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {10827#false} assume !false; {10827#false} is VALID [2018-11-23 11:25:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:41,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:41,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {10827#false} assume !false; {10827#false} is VALID [2018-11-23 11:25:41,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {10827#false} assume 0bv32 == ~cond; {10827#false} is VALID [2018-11-23 11:25:41,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {10827#false} ~cond := #in~cond; {10827#false} is VALID [2018-11-23 11:25:41,594 INFO L256 TraceCheckUtils]: 35: Hoare triple {10827#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {10827#false} is VALID [2018-11-23 11:25:41,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {10964#(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; {10827#false} is VALID [2018-11-23 11:25:41,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short16;havoc #t~mem15;havoc #t~short16; {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short16; {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} assume !#t~short13; {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {10986#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} ~j~0 := ~bvsub32(~i~0, 1bv32); {10964#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:25:41,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {10990#(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; {10986#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {10990#(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); {10990#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {10990#(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; {10990#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {10990#(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); {10990#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {10990#(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); {10990#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {11006#(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; {10990#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv1 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {11006#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~short6; {11006#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {11006#(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); {11006#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 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; {11006#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv2 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~short6; {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 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); {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} assume #t~switch3; {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} #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); {11016#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:25:41,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} call #t~mem0 := read~intINTTYPE1(~str.base, ~bvadd32(~str.offset, ~i~0), 1bv32); {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} assume !#t~switch3; {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {11045#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} #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); {11029#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) parse_expression_list_~i~0))} is VALID [2018-11-23 11:25:41,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {11045#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {11045#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} is VALID [2018-11-23 11:25:41,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {10826#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); {11045#(not (bvsle (bvadd parse_expression_list_~start~0 (_ bv3 32)) (bvadd parse_expression_list_~i~0 (_ bv1 32))))} is VALID [2018-11-23 11:25:41,740 INFO L256 TraceCheckUtils]: 6: Hoare triple {10826#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {10826#true} is VALID [2018-11-23 11:25:41,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {10826#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {10826#true} is VALID [2018-11-23 11:25:41,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {10826#true} call #t~ret20 := main(); {10826#true} is VALID [2018-11-23 11:25:41,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10826#true} {10826#true} #125#return; {10826#true} is VALID [2018-11-23 11:25:41,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {10826#true} assume true; {10826#true} is VALID [2018-11-23 11:25:41,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {10826#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {10826#true} is VALID [2018-11-23 11:25:41,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {10826#true} call ULTIMATE.init(); {10826#true} is VALID [2018-11-23 11:25:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:41,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:41,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:25:41,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 11:25:41,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:41,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:25:41,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:41,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:25:41,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:25:41,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:25:41,949 INFO L87 Difference]: Start difference. First operand 465 states and 610 transitions. Second operand 16 states. [2018-11-23 11:25:42,786 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-11-23 11:25:44,498 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-23 11:25:47,743 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-11-23 11:25:56,621 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-11-23 11:26:00,217 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-11-23 11:26:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:12,911 INFO L93 Difference]: Finished difference Result 1793 states and 2367 transitions. [2018-11-23 11:26:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:26:12,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-23 11:26:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:26:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 613 transitions. [2018-11-23 11:26:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:26:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 613 transitions. [2018-11-23 11:26:12,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 613 transitions. [2018-11-23 11:26:17,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:17,163 INFO L225 Difference]: With dead ends: 1793 [2018-11-23 11:26:17,163 INFO L226 Difference]: Without dead ends: 1397 [2018-11-23 11:26:17,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=342, Invalid=848, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:26:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-11-23 11:26:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 769. [2018-11-23 11:26:17,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:17,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1397 states. Second operand 769 states. [2018-11-23 11:26:17,569 INFO L74 IsIncluded]: Start isIncluded. First operand 1397 states. Second operand 769 states. [2018-11-23 11:26:17,569 INFO L87 Difference]: Start difference. First operand 1397 states. Second operand 769 states. [2018-11-23 11:26:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:17,645 INFO L93 Difference]: Finished difference Result 1397 states and 1835 transitions. [2018-11-23 11:26:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1835 transitions. [2018-11-23 11:26:17,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:17,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:17,650 INFO L74 IsIncluded]: Start isIncluded. First operand 769 states. Second operand 1397 states. [2018-11-23 11:26:17,650 INFO L87 Difference]: Start difference. First operand 769 states. Second operand 1397 states. [2018-11-23 11:26:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:17,718 INFO L93 Difference]: Finished difference Result 1397 states and 1835 transitions. [2018-11-23 11:26:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1835 transitions. [2018-11-23 11:26:17,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:17,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:17,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:17,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-11-23 11:26:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1025 transitions. [2018-11-23 11:26:17,762 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1025 transitions. Word has length 39 [2018-11-23 11:26:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:17,762 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1025 transitions. [2018-11-23 11:26:17,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:26:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1025 transitions. [2018-11-23 11:26:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:26:17,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:17,763 INFO L402 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-23 11:26:17,764 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash 22950958, now seen corresponding path program 2 times [2018-11-23 11:26:17,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:17,765 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-23 11:26:17,792 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:17,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:17,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:17,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:18,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {16895#true} call ULTIMATE.init(); {16895#true} is VALID [2018-11-23 11:26:18,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {16895#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {16895#true} is VALID [2018-11-23 11:26:18,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {16895#true} assume true; {16895#true} is VALID [2018-11-23 11:26:18,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16895#true} {16895#true} #125#return; {16895#true} is VALID [2018-11-23 11:26:18,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {16895#true} call #t~ret20 := main(); {16895#true} is VALID [2018-11-23 11:26:18,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {16895#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {16895#true} is VALID [2018-11-23 11:26:18,181 INFO L256 TraceCheckUtils]: 6: Hoare triple {16895#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {16895#true} is VALID [2018-11-23 11:26:18,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {16895#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); {16921#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:18,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {16921#(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); {16921#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:18,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {16921#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {16928#(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); {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {16928#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} #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); {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:18,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~switch3; {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:18,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:18,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {16944#(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); {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:18,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:18,191 INFO L273 TraceCheckUtils]: 19: Hoare triple {16944#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} #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); {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {16960#(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); {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {16960#(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); {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {16960#(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; {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {16960#(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); {16960#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {16960#(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; {16979#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:18,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {16979#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {16987#(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-23 11:26:18,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {16987#(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); {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {16983#(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); {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := #t~short12; {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {16983#(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~short13;havoc #t~mem10;havoc #t~mem11; {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {16983#(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); {16983#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {16983#(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; {17009#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= parse_expression_list_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:18,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {17009#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= parse_expression_list_~j~0 (_ 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; {16896#false} is VALID [2018-11-23 11:26:18,205 INFO L256 TraceCheckUtils]: 36: Hoare triple {16896#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {16896#false} is VALID [2018-11-23 11:26:18,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {16896#false} ~cond := #in~cond; {16896#false} is VALID [2018-11-23 11:26:18,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {16896#false} assume 0bv32 == ~cond; {16896#false} is VALID [2018-11-23 11:26:18,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {16896#false} assume !false; {16896#false} is VALID [2018-11-23 11:26:18,210 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-23 11:26:18,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:18,712 INFO L273 TraceCheckUtils]: 39: Hoare triple {16896#false} assume !false; {16896#false} is VALID [2018-11-23 11:26:18,713 INFO L273 TraceCheckUtils]: 38: Hoare triple {16896#false} assume 0bv32 == ~cond; {16896#false} is VALID [2018-11-23 11:26:18,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {16896#false} ~cond := #in~cond; {16896#false} is VALID [2018-11-23 11:26:18,713 INFO L256 TraceCheckUtils]: 36: Hoare triple {16896#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {16896#false} is VALID [2018-11-23 11:26:18,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {17037#(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; {16896#false} is VALID [2018-11-23 11:26:18,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {17041#(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; {17037#(not (bvsle parse_expression_list_~start~0 parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:18,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {17041#(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); {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:26:18,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} #t~short16 := ~bvslt32(0bv32, ~j~0); {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:26:18,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:26:18,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} #t~short13 := #t~short12; {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:26:18,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {17041#(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); {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:26:18,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {17060#(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); {17041#(not (bvsle parse_expression_list_~start~0 (bvadd parse_expression_list_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:26:18,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {17064#(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); {17060#(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-23 11:26:18,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {17068#(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); {17064#(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-23 11:26:18,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {17072#(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; {17068#(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-23 11:26:18,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {17072#(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); {17072#(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-23 11:26:18,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {17072#(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; {17072#(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-23 11:26:18,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {17072#(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); {17072#(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-23 11:26:18,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {17072#(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); {17072#(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-23 11:26:18,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {17072#(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; {17072#(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-23 11:26:18,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {17091#(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)))} #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); {17072#(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-23 11:26:18,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {17091#(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; {17091#(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-23 11:26:18,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {17091#(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); {17091#(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-23 11:26:18,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {17091#(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; {17091#(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-23 11:26:18,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {17091#(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; {17091#(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-23 11:26:18,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {17107#(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)))))} #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); {17091#(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-23 11:26:18,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {17107#(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; {17107#(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-23 11:26:18,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {17107#(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); {17107#(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-23 11:26:18,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {17107#(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; {17107#(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-23 11:26:18,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {17107#(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; {17107#(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-23 11:26:18,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {17123#(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)))))} #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); {17107#(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-23 11:26:18,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {17123#(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); {17123#(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-23 11:26:18,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {16895#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); {17123#(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-23 11:26:18,826 INFO L256 TraceCheckUtils]: 6: Hoare triple {16895#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {16895#true} is VALID [2018-11-23 11:26:18,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {16895#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {16895#true} is VALID [2018-11-23 11:26:18,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {16895#true} call #t~ret20 := main(); {16895#true} is VALID [2018-11-23 11:26:18,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16895#true} {16895#true} #125#return; {16895#true} is VALID [2018-11-23 11:26:18,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {16895#true} assume true; {16895#true} is VALID [2018-11-23 11:26:18,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {16895#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {16895#true} is VALID [2018-11-23 11:26:18,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {16895#true} call ULTIMATE.init(); {16895#true} is VALID [2018-11-23 11:26:18,830 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-23 11:26:18,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-23 11:26:18,832 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 11:26:18,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:18,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:26:19,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:19,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:26:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:26:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:26:19,047 INFO L87 Difference]: Start difference. First operand 769 states and 1025 transitions. Second operand 19 states. [2018-11-23 11:26:20,010 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-11-23 11:26:21,700 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-11-23 11:26:24,446 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 11:26:25,259 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-11-23 11:26:26,159 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-11-23 11:26:28,054 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-11-23 11:26:28,882 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-23 11:26:33,515 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 11:26:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:39,953 INFO L93 Difference]: Finished difference Result 2044 states and 2715 transitions. [2018-11-23 11:26:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 11:26:39,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 11:26:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:26:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 557 transitions. [2018-11-23 11:26:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:26:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 557 transitions. [2018-11-23 11:26:39,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 557 transitions. [2018-11-23 11:26:42,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 557 edges. 557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:42,387 INFO L225 Difference]: With dead ends: 2044 [2018-11-23 11:26:42,387 INFO L226 Difference]: Without dead ends: 1492 [2018-11-23 11:26:42,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=616, Invalid=2464, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:26:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2018-11-23 11:26:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 897. [2018-11-23 11:26:43,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:43,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1492 states. Second operand 897 states. [2018-11-23 11:26:43,156 INFO L74 IsIncluded]: Start isIncluded. First operand 1492 states. Second operand 897 states. [2018-11-23 11:26:43,156 INFO L87 Difference]: Start difference. First operand 1492 states. Second operand 897 states. [2018-11-23 11:26:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:43,251 INFO L93 Difference]: Finished difference Result 1492 states and 1975 transitions. [2018-11-23 11:26:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1975 transitions. [2018-11-23 11:26:43,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:43,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:43,254 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand 1492 states. [2018-11-23 11:26:43,254 INFO L87 Difference]: Start difference. First operand 897 states. Second operand 1492 states. [2018-11-23 11:26:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:43,349 INFO L93 Difference]: Finished difference Result 1492 states and 1975 transitions. [2018-11-23 11:26:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1975 transitions. [2018-11-23 11:26:43,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:43,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:43,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:43,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-11-23 11:26:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1194 transitions. [2018-11-23 11:26:43,394 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1194 transitions. Word has length 40 [2018-11-23 11:26:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:43,394 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1194 transitions. [2018-11-23 11:26:43,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:26:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1194 transitions. [2018-11-23 11:26:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:26:43,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:43,395 INFO L402 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-23 11:26:43,395 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:43,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash 80209260, now seen corresponding path program 1 times [2018-11-23 11:26:43,396 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:43,396 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-23 11:26:43,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:26:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:43,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:43,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {23635#true} call ULTIMATE.init(); {23635#true} is VALID [2018-11-23 11:26:43,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {23635#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {23635#true} is VALID [2018-11-23 11:26:43,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {23635#true} assume true; {23635#true} is VALID [2018-11-23 11:26:43,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23635#true} {23635#true} #125#return; {23635#true} is VALID [2018-11-23 11:26:43,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {23635#true} call #t~ret20 := main(); {23635#true} is VALID [2018-11-23 11:26:43,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {23635#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {23635#true} is VALID [2018-11-23 11:26:43,685 INFO L256 TraceCheckUtils]: 6: Hoare triple {23635#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {23635#true} is VALID [2018-11-23 11:26:43,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {23635#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); {23661#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:43,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {23661#(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); {23661#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:43,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {23661#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {23668#(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); {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {23668#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} #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); {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:43,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~switch3; {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:43,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:43,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {23684#(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); {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:43,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:43,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {23684#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} #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); {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {23700#(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); {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {23700#(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); {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {23700#(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; {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {23700#(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); {23700#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:26:43,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {23700#(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; {23719#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:26:43,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {23719#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) parse_expression_list_~i~0))} ~j~0 := ~bvsub32(~i~0, 1bv32); {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {23723#(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); {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,714 INFO L273 TraceCheckUtils]: 29: Hoare triple {23723#(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); {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := #t~short12; {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {23723#(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~short13;havoc #t~mem10;havoc #t~mem11; {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {23723#(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); {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,718 INFO L273 TraceCheckUtils]: 34: Hoare triple {23723#(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; {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {23723#(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; {23723#(and (= (bvadd parse_expression_list_~start~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:26:43,743 INFO L256 TraceCheckUtils]: 36: Hoare triple {23723#(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)); {23754#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:43,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {23754#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {23758#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:43,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {23758#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {23636#false} is VALID [2018-11-23 11:26:43,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {23636#false} assume !false; {23636#false} is VALID [2018-11-23 11:26:43,747 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-23 11:26:43,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:44,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {23636#false} assume !false; {23636#false} is VALID [2018-11-23 11:26:44,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {23768#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {23636#false} is VALID [2018-11-23 11:26:44,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {23772#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {23768#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:44,192 INFO L256 TraceCheckUtils]: 36: Hoare triple {23776#(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)); {23772#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:44,192 INFO L273 TraceCheckUtils]: 35: Hoare triple {23776#(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; {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,192 INFO L273 TraceCheckUtils]: 34: Hoare triple {23776#(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; {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {23776#(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); {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short16 := ~bvslt32(0bv32, ~j~0); {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {23776#(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~short13;havoc #t~mem10;havoc #t~mem11; {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short13 := #t~short12; {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {23776#(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); {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {23776#(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); {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} ~j~0 := ~bvsub32(~i~0, 1bv32); {23776#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {23811#(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; {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {23811#(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); {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-23 11:26:44,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {23811#(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; {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-23 11:26:44,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {23811#(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); {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-23 11:26:44,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {23811#(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); {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-23 11:26:44,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} assume #t~switch3; {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-23 11:26:44,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #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); {23811#(bvslt (bvadd parse_expression_list_~i~0 (bvneg (bvadd parse_expression_list_~start~0 (_ bv1 32)))) (_ bv2 32))} is VALID [2018-11-23 11:26:44,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {23807#(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); {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~switch3; {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #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); {23807#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {23845#(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; {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {23845#(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); {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~switch3; {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {23861#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} #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); {23845#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {23861#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {23861#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {23635#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); {23861#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:44,887 INFO L256 TraceCheckUtils]: 6: Hoare triple {23635#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {23635#true} is VALID [2018-11-23 11:26:44,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {23635#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {23635#true} is VALID [2018-11-23 11:26:44,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {23635#true} call #t~ret20 := main(); {23635#true} is VALID [2018-11-23 11:26:44,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23635#true} {23635#true} #125#return; {23635#true} is VALID [2018-11-23 11:26:44,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {23635#true} assume true; {23635#true} is VALID [2018-11-23 11:26:44,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {23635#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {23635#true} is VALID [2018-11-23 11:26:44,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {23635#true} call ULTIMATE.init(); {23635#true} is VALID [2018-11-23 11:26:44,890 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-23 11:26:44,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:44,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-23 11:26:44,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 11:26:44,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:44,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:26:45,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:45,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:26:45,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:26:45,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:26:45,737 INFO L87 Difference]: Start difference. First operand 897 states and 1194 transitions. Second operand 17 states. [2018-11-23 11:26:56,476 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-23 11:26:58,049 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-23 11:27:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:16,362 INFO L93 Difference]: Finished difference Result 2456 states and 3246 transitions. [2018-11-23 11:27:16,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:27:16,362 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 11:27:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:27:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 545 transitions. [2018-11-23 11:27:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:27:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 545 transitions. [2018-11-23 11:27:16,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 545 transitions. [2018-11-23 11:27:23,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 545 edges. 545 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:24,203 INFO L225 Difference]: With dead ends: 2456 [2018-11-23 11:27:24,203 INFO L226 Difference]: Without dead ends: 2454 [2018-11-23 11:27:24,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:27:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2018-11-23 11:27:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 1021. [2018-11-23 11:27:25,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:25,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2454 states. Second operand 1021 states. [2018-11-23 11:27:25,007 INFO L74 IsIncluded]: Start isIncluded. First operand 2454 states. Second operand 1021 states. [2018-11-23 11:27:25,007 INFO L87 Difference]: Start difference. First operand 2454 states. Second operand 1021 states. [2018-11-23 11:27:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:25,233 INFO L93 Difference]: Finished difference Result 2454 states and 3244 transitions. [2018-11-23 11:27:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3244 transitions. [2018-11-23 11:27:25,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:25,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:25,237 INFO L74 IsIncluded]: Start isIncluded. First operand 1021 states. Second operand 2454 states. [2018-11-23 11:27:25,237 INFO L87 Difference]: Start difference. First operand 1021 states. Second operand 2454 states. [2018-11-23 11:27:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:25,477 INFO L93 Difference]: Finished difference Result 2454 states and 3244 transitions. [2018-11-23 11:27:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3244 transitions. [2018-11-23 11:27:25,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:25,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:25,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:25,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-11-23 11:27:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1366 transitions. [2018-11-23 11:27:25,533 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1366 transitions. Word has length 40 [2018-11-23 11:27:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:25,534 INFO L480 AbstractCegarLoop]: Abstraction has 1021 states and 1366 transitions. [2018-11-23 11:27:25,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:27:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1366 transitions. [2018-11-23 11:27:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:27:25,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:25,535 INFO L402 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-23 11:27:25,535 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:25,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1256912720, now seen corresponding path program 1 times [2018-11-23 11:27:25,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:25,535 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-23 11:27:25,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:25,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:25,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {32877#true} call ULTIMATE.init(); {32877#true} is VALID [2018-11-23 11:27:25,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {32877#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32877#true} is VALID [2018-11-23 11:27:25,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {32877#true} assume true; {32877#true} is VALID [2018-11-23 11:27:25,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32877#true} {32877#true} #125#return; {32877#true} is VALID [2018-11-23 11:27:25,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {32877#true} call #t~ret20 := main(); {32877#true} is VALID [2018-11-23 11:27:25,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {32877#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {32877#true} is VALID [2018-11-23 11:27:25,822 INFO L256 TraceCheckUtils]: 6: Hoare triple {32877#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {32877#true} is VALID [2018-11-23 11:27:25,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {32877#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); {32903#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:25,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {32903#(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); {32903#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:25,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {32903#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (bvadd parse_expression_list_~i~0 (_ bv1 32)) (_ bv0 32)))} #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); {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !#t~switch3; {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} havoc #t~mem2;havoc #t~switch3; {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {32910#(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); {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {32910#(and (= (_ bv0 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} #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); {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:27:25,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !#t~switch3; {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:27:25,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} havoc #t~mem2;havoc #t~switch3; {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:27:25,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {32926#(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); {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:27:25,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} is VALID [2018-11-23 11:27:25,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {32926#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~i~0))} #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); {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume #t~switch3; {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {32942#(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); {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {32942#(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); {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {32942#(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; {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {32942#(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); {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} assume !(34bv32 == ~sign_extendFrom8To32(#t~mem8));havoc #t~mem8; {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {32942#(and (= (_ bv2 32) parse_expression_list_~i~0) (= parse_expression_list_~start~0 (_ bv0 32)))} ~j~0 := ~bvsub32(~i~0, 1bv32); {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := ~bvslt32(0bv32, ~j~0); {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {32964#(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); {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {32964#(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); {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short13 := #t~short12; {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} #t~short16 := ~bvslt32(0bv32, ~j~0); {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {32964#(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); {32964#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= (_ bv1 32) parse_expression_list_~j~0))} is VALID [2018-11-23 11:27:25,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {32964#(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; {32989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= parse_expression_list_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {32989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= parse_expression_list_~j~0 (_ 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; {32989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= parse_expression_list_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:25,846 INFO L256 TraceCheckUtils]: 36: Hoare triple {32989#(and (= parse_expression_list_~start~0 (_ bv0 32)) (= parse_expression_list_~j~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~bvsub32(~j~0, ~start~0)), 2bv32) then 1bv32 else 0bv32)); {32996#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:25,847 INFO L273 TraceCheckUtils]: 37: Hoare triple {32996#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {33000#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:25,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {33000#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {32878#false} is VALID [2018-11-23 11:27:25,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {32878#false} assume !false; {32878#false} is VALID [2018-11-23 11:27:25,851 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-23 11:27:25,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:26,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {32878#false} assume !false; {32878#false} is VALID [2018-11-23 11:27:26,354 INFO L273 TraceCheckUtils]: 38: Hoare triple {33010#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {32878#false} is VALID [2018-11-23 11:27:26,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {33014#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {33010#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:27:26,356 INFO L256 TraceCheckUtils]: 36: Hoare triple {33018#(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)); {33014#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:27:26,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {33018#(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; {33018#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {33025#(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; {33018#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {33025#(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); {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #t~short16 := ~bvslt32(0bv32, ~j~0); {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~short13;havoc #t~short12;havoc #t~short13;havoc #t~mem10;havoc #t~mem11; {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #t~short13 := #t~short12; {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {33025#(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); {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {33025#(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); {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #t~short13 := ~bvslt32(0bv32, ~j~0); {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} ~j~0 := ~bvsub32(~i~0, 1bv32); {33025#(bvslt (bvadd parse_expression_list_~j~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {33050#(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; {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {33050#(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); {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {33050#(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; {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {33050#(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); {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {33050#(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); {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} assume #t~switch3; {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} #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); {33050#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv4294967295 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem0));havoc #t~mem0; {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {33072#(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); {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} assume !#t~switch3; {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} #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); {33072#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {33088#(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; {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {33088#(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); {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} havoc #t~mem2;havoc #t~switch3; {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:26,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} assume !#t~switch3; {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:27,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {33104#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} #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); {33088#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:27,015 INFO L273 TraceCheckUtils]: 8: Hoare triple {33104#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} assume !(~str.base == 0bv32 && ~str.offset == 0bv32); {33104#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:27,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {32877#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); {33104#(bvslt (bvadd parse_expression_list_~i~0 (bvneg parse_expression_list_~start~0) (_ bv2 32)) (_ bv2 32))} is VALID [2018-11-23 11:27:27,016 INFO L256 TraceCheckUtils]: 6: Hoare triple {32877#true} call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); {32877#true} is VALID [2018-11-23 11:27:27,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {32877#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9bv32);call write~intINTTYPE1(0bv8, ~#A~0.base, ~bvadd32(8bv32, ~#A~0.offset), 1bv32); {32877#true} is VALID [2018-11-23 11:27:27,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {32877#true} call #t~ret20 := main(); {32877#true} is VALID [2018-11-23 11:27:27,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32877#true} {32877#true} #125#return; {32877#true} is VALID [2018-11-23 11:27:27,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {32877#true} assume true; {32877#true} is VALID [2018-11-23 11:27:27,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {32877#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32877#true} is VALID [2018-11-23 11:27:27,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {32877#true} call ULTIMATE.init(); {32877#true} is VALID [2018-11-23 11:27:27,021 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-23 11:27:27,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:27,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 11:27:27,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 11:27:27,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:27,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:27:27,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:27,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:27:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:27:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:27:27,812 INFO L87 Difference]: Start difference. First operand 1021 states and 1366 transitions. Second operand 18 states. [2018-11-23 11:27:29,030 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-23 11:27:31,654 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-23 11:27:41,483 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-11-23 11:27:43,102 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-23 11:28:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:15,688 INFO L93 Difference]: Finished difference Result 2925 states and 3876 transitions. [2018-11-23 11:28:15,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:28:15,688 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 11:28:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:28:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 710 transitions. [2018-11-23 11:28:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:28:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 710 transitions. [2018-11-23 11:28:15,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 710 transitions.