./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49da897df5dcdfc1bc615bb8c40422792fce477f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:59:32,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:59:32,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:59:32,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:59:32,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:59:32,378 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:59:32,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:59:32,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:59:32,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:59:32,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:59:32,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:59:32,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:59:32,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:59:32,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:59:32,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:59:32,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:59:32,387 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:59:32,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:59:32,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:59:32,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:59:32,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:59:32,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:59:32,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:59:32,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:59:32,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:59:32,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:59:32,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:59:32,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:59:32,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:59:32,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:59:32,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:59:32,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:59:32,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:59:32,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:59:32,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:59:32,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:59:32,403 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:59:32,415 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:59:32,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:59:32,416 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:59:32,416 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:59:32,417 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:59:32,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:59:32,417 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:59:32,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:59:32,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:59:32,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:59:32,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:59:32,419 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:59:32,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:59:32,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:59:32,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:59:32,420 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:59:32,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:59:32,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:59:32,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49da897df5dcdfc1bc615bb8c40422792fce477f [2018-11-23 13:59:32,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:59:32,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:59:32,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:59:32,460 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:59:32,460 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:59:32,460 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 13:59:32,505 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/data/75a5a0fc8/374a1ef0be8f46768a66eaa1ef846082/FLAG408bdd1f1 [2018-11-23 13:59:32,858 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:59:32,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 13:59:32,866 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/data/75a5a0fc8/374a1ef0be8f46768a66eaa1ef846082/FLAG408bdd1f1 [2018-11-23 13:59:33,273 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/data/75a5a0fc8/374a1ef0be8f46768a66eaa1ef846082 [2018-11-23 13:59:33,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:59:33,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:59:33,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:59:33,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:59:33,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:59:33,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0cf10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33, skipping insertion in model container [2018-11-23 13:59:33,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:59:33,301 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:59:33,439 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:59:33,447 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:59:33,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:59:33,483 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:59:33,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33 WrapperNode [2018-11-23 13:59:33,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:59:33,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:59:33,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:59:33,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:59:33,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:59:33,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:59:33,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:59:33,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:59:33,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... [2018-11-23 13:59:33,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:59:33,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:59:33,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:59:33,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:59:33,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/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 13:59:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-23 13:59:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:59:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:59:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:59:33,631 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-23 13:59:33,631 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-23 13:59:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:59:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:59:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:59:33,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:59:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:59:33,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:59:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:59:33,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:59:33,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:59:33,870 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:59:33,870 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:59:33,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:33 BoogieIcfgContainer [2018-11-23 13:59:33,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:59:33,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:59:33,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:59:33,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:59:33,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:59:33" (1/3) ... [2018-11-23 13:59:33,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451cd737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:33, skipping insertion in model container [2018-11-23 13:59:33,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:33" (2/3) ... [2018-11-23 13:59:33,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451cd737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:59:33, skipping insertion in model container [2018-11-23 13:59:33,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:33" (3/3) ... [2018-11-23 13:59:33,878 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-23 13:59:33,890 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:59:33,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:59:33,915 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:59:33,946 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:59:33,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:59:33,947 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:59:33,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:59:33,947 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:59:33,947 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:59:33,947 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:59:33,947 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:59:33,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:59:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-23 13:59:33,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:59:33,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:33,973 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 13:59:33,975 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:33,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash 526401824, now seen corresponding path program 1 times [2018-11-23 13:59:33,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:33,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:34,119 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 13:59:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:34,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:59:34,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:59:34,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:59:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:59:34,136 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-23 13:59:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:34,154 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2018-11-23 13:59:34,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:59:34,155 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 13:59:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:34,161 INFO L225 Difference]: With dead ends: 83 [2018-11-23 13:59:34,162 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:59:34,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:59:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:59:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:59:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:59:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-11-23 13:59:34,193 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2018-11-23 13:59:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:34,194 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-23 13:59:34,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:59:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 13:59:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:59:34,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:34,195 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 13:59:34,195 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:34,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 269462985, now seen corresponding path program 1 times [2018-11-23 13:59:34,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:34,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:34,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:34,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:34,266 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 13:59:34,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:34,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:59:34,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:59:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:59:34,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:59:34,268 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 3 states. [2018-11-23 13:59:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:34,286 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2018-11-23 13:59:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:59:34,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 13:59:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:34,287 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:59:34,287 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:59:34,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:59:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:59:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:59:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:59:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 13:59:34,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 28 [2018-11-23 13:59:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:34,292 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 13:59:34,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:59:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 13:59:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:59:34,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:34,293 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 13:59:34,294 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:34,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -751605369, now seen corresponding path program 1 times [2018-11-23 13:59:34,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:34,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:34,366 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 13:59:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:59:34,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:59:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:59:34,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:59:34,368 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 5 states. [2018-11-23 13:59:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:34,472 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2018-11-23 13:59:34,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:59:34,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 13:59:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:34,475 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:59:34,475 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:59:34,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:59:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:59:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2018-11-23 13:59:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:59:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2018-11-23 13:59:34,485 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 28 [2018-11-23 13:59:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:34,486 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2018-11-23 13:59:34,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:59:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 13:59:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:59:34,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:34,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] [2018-11-23 13:59:34,487 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:34,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1080660295, now seen corresponding path program 1 times [2018-11-23 13:59:34,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:34,571 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 13:59:34,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:34,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:59:34,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:59:34,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:59:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:59:34,573 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 6 states. [2018-11-23 13:59:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:34,714 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2018-11-23 13:59:34,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:59:34,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 13:59:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:34,715 INFO L225 Difference]: With dead ends: 146 [2018-11-23 13:59:34,715 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 13:59:34,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:59:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 13:59:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2018-11-23 13:59:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:59:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-23 13:59:34,724 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 28 [2018-11-23 13:59:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:34,724 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 13:59:34,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:59:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-23 13:59:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:59:34,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:34,726 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 13:59:34,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:34,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:34,726 INFO L82 PathProgramCache]: Analyzing trace with hash 493854281, now seen corresponding path program 1 times [2018-11-23 13:59:34,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:34,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:34,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:34,795 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 13:59:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:59:34,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:59:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:59:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:59:34,797 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 5 states. [2018-11-23 13:59:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:34,889 INFO L93 Difference]: Finished difference Result 126 states and 163 transitions. [2018-11-23 13:59:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:59:34,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 13:59:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:34,895 INFO L225 Difference]: With dead ends: 126 [2018-11-23 13:59:34,896 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:59:34,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:59:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:59:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2018-11-23 13:59:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:59:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 13:59:34,904 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 28 [2018-11-23 13:59:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:34,904 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 13:59:34,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:59:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 13:59:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:59:34,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:34,905 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 13:59:34,905 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:34,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2145597124, now seen corresponding path program 1 times [2018-11-23 13:59:34,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:34,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:34,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:34,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:59:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:59:34,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:59:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:59:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:59:34,998 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 7 states. [2018-11-23 13:59:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:35,140 INFO L93 Difference]: Finished difference Result 148 states and 197 transitions. [2018-11-23 13:59:35,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:59:35,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 13:59:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:35,142 INFO L225 Difference]: With dead ends: 148 [2018-11-23 13:59:35,142 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 13:59:35,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:59:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 13:59:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2018-11-23 13:59:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:59:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2018-11-23 13:59:35,150 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 33 [2018-11-23 13:59:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:35,151 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2018-11-23 13:59:35,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:59:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2018-11-23 13:59:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:59:35,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:35,152 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 13:59:35,152 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:35,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:35,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1558791110, now seen corresponding path program 1 times [2018-11-23 13:59:35,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:35,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:59:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:59:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:59:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:59:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:59:35,230 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 7 states. [2018-11-23 13:59:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:35,325 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 13:59:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:59:35,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 13:59:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:35,327 INFO L225 Difference]: With dead ends: 104 [2018-11-23 13:59:35,327 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 13:59:35,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:59:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 13:59:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2018-11-23 13:59:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:59:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2018-11-23 13:59:35,335 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 33 [2018-11-23 13:59:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:35,336 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2018-11-23 13:59:35,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:59:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2018-11-23 13:59:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:59:35,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:35,337 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 13:59:35,337 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:35,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash -431019319, now seen corresponding path program 1 times [2018-11-23 13:59:35,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:35,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:35,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:35,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:59:35,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:59:35,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:59:35,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:59:35,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:59:35,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:59:35,372 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand 4 states. [2018-11-23 13:59:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:35,395 INFO L93 Difference]: Finished difference Result 148 states and 192 transitions. [2018-11-23 13:59:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:59:35,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 13:59:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:35,396 INFO L225 Difference]: With dead ends: 148 [2018-11-23 13:59:35,397 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 13:59:35,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:59:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 13:59:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-23 13:59:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 13:59:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-23 13:59:35,405 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 35 [2018-11-23 13:59:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:35,405 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-23 13:59:35,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:59:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-23 13:59:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:59:35,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:35,406 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 13:59:35,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:35,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash 270045259, now seen corresponding path program 1 times [2018-11-23 13:59:35,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:35,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:35,464 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 13:59:35,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:59:35,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:59:35,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:35,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:59:35,540 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 13:59:35,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:59:35,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:59:35,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:59:35,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:59:35,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:59:35,560 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 8 states. [2018-11-23 13:59:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:35,653 INFO L93 Difference]: Finished difference Result 211 states and 268 transitions. [2018-11-23 13:59:35,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:59:35,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 13:59:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:35,655 INFO L225 Difference]: With dead ends: 211 [2018-11-23 13:59:35,655 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 13:59:35,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:59:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 13:59:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2018-11-23 13:59:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 13:59:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-11-23 13:59:35,664 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 35 [2018-11-23 13:59:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:35,665 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-11-23 13:59:35,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:59:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-23 13:59:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:59:35,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:35,666 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 13:59:35,666 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:35,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 22950958, now seen corresponding path program 2 times [2018-11-23 13:59:35,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:35,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:35,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:35,752 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 13:59:35,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:59:35,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:59:35,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:59:35,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:59:35,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:59:35,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:59:35,908 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 13:59:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:59:35,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 13:59:35,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:59:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:59:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:59:35,928 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 16 states. [2018-11-23 13:59:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:36,222 INFO L93 Difference]: Finished difference Result 221 states and 276 transitions. [2018-11-23 13:59:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:59:36,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 13:59:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:36,224 INFO L225 Difference]: With dead ends: 221 [2018-11-23 13:59:36,224 INFO L226 Difference]: Without dead ends: 171 [2018-11-23 13:59:36,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:59:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-23 13:59:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2018-11-23 13:59:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 13:59:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2018-11-23 13:59:36,236 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 40 [2018-11-23 13:59:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:36,236 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2018-11-23 13:59:36,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:59:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2018-11-23 13:59:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:59:36,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:36,237 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 13:59:36,238 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:36,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash 80209260, now seen corresponding path program 1 times [2018-11-23 13:59:36,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:36,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:36,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:59:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:36,318 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 13:59:36,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:59:36,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:59:36,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:36,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:59:36,432 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 13:59:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:59:36,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-23 13:59:36,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:59:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:59:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:59:36,451 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 16 states. [2018-11-23 13:59:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:36,651 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2018-11-23 13:59:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:59:36,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 13:59:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:36,653 INFO L225 Difference]: With dead ends: 180 [2018-11-23 13:59:36,653 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 13:59:36,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:59:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 13:59:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2018-11-23 13:59:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 13:59:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2018-11-23 13:59:36,662 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 40 [2018-11-23 13:59:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:36,662 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2018-11-23 13:59:36,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:59:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2018-11-23 13:59:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:59:36,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:36,664 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 13:59:36,664 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:36,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:36,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1256912720, now seen corresponding path program 1 times [2018-11-23 13:59:36,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:36,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:36,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:36,746 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 13:59:36,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:59:36,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:59:36,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:59:36,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:59:36,901 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 13:59:36,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:59:36,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-23 13:59:36,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:59:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:59:36,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:59:36,934 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 16 states. [2018-11-23 13:59:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:59:37,197 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2018-11-23 13:59:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:59:37,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-23 13:59:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:59:37,199 INFO L225 Difference]: With dead ends: 198 [2018-11-23 13:59:37,199 INFO L226 Difference]: Without dead ends: 196 [2018-11-23 13:59:37,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:59:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-23 13:59:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 145. [2018-11-23 13:59:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 13:59:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2018-11-23 13:59:37,205 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 40 [2018-11-23 13:59:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:59:37,205 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2018-11-23 13:59:37,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:59:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2018-11-23 13:59:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:59:37,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:59:37,207 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 13:59:37,207 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:59:37,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:59:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1199654418, now seen corresponding path program 1 times [2018-11-23 13:59:37,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:59:37,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:59:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:37,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:59:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:59:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:59:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:59:37,251 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=38, |#NULL.offset|=35, |old(#NULL.base)|=38, |old(#NULL.offset)|=35] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=38, |old(#NULL.offset)|=35] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=38, |old(#NULL.offset)|=35] [?] RET #125#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=39, |main_~#A~0.offset|=0] [?] CALL call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0] [?] ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); VAL [parse_expression_list_~i~0=(- 1), parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !(~str.base == 0 && ~str.offset == 0); VAL [parse_expression_list_~i~0=(- 1), parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=1, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~switch3; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=1, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] havoc #t~mem2;havoc #t~switch3; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem0|=1, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !!(0 != #t~mem0);havoc #t~mem0; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=36, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~switch3; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=36, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] havoc #t~mem2;havoc #t~switch3; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem0|=36, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !!(0 != #t~mem0);havoc #t~mem0; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume #t~switch3; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 32 == #t~mem4; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~mem4|=1, |parse_expression_list_#t~short6|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short6;call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 9 == #t~mem5; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~mem4|=1, |parse_expression_list_#t~mem5|=1, |parse_expression_list_#t~short6|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short6;havoc #t~short6;havoc #t~mem5;havoc #t~mem4; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~mem8|=1, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !(34 == #t~mem8);havoc #t~mem8; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] ~j~0 := ~i~0 - 1; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~short13 := 0 < ~j~0; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short13|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume #t~short13;call #t~mem10 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short12 := 32 == #t~mem10; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem10|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short12|=false, |parse_expression_list_#t~short13|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short12;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short12 := 9 == #t~mem11; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem10|=36, |parse_expression_list_#t~mem11|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short12|=false, |parse_expression_list_#t~short13|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~short13 := #t~short12; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem10|=36, |parse_expression_list_#t~mem11|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short12|=false, |parse_expression_list_#t~short13|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short13;havoc #t~mem11;havoc #t~short13;havoc #t~mem10;havoc #t~short12; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~short16 := 0 < ~j~0; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short16|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume #t~short16;call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short16 := 34 == #t~mem15; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem15|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short16|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short16;havoc #t~short16;havoc #t~mem15; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume ~start~0 <= ~j~0;call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0));havoc #t~ret18.base, #t~ret18.offset; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=38, #NULL.offset=35, old(#NULL.base)=38, old(#NULL.offset)=35] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L75] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9); [L76] call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=39, ~#A~0.offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0] [L47-L72] ~str.base, ~str.offset := #in~str.base, #in~str.offset; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L51] assume !(~str.base == 0 && ~str.offset == 0); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=36, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] assume !(34 == #t~mem8); [L57] havoc #t~mem8; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume #t~short13; [L59] call #t~mem10 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short12; [L59] call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short13; [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume #t~short16; [L60] call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume !#t~short16; [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L61-L67] assume ~start~0 <= ~j~0; [L62] call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18.base, #t~ret18.offset; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=38, #NULL.offset=35, old(#NULL.base)=38, old(#NULL.offset)=35] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L75] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9); [L76] call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=39, ~#A~0.offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0] [L47-L72] ~str.base, ~str.offset := #in~str.base, #in~str.offset; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L51] assume !(~str.base == 0 && ~str.offset == 0); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=36, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] assume !(34 == #t~mem8); [L57] havoc #t~mem8; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume #t~short13; [L59] call #t~mem10 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short12; [L59] call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short13; [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume #t~short16; [L60] call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume !#t~short16; [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L61-L67] assume ~start~0 <= ~j~0; [L62] call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18.base, #t~ret18.offset; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- [2018-11-23 13:59:37,300 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,301 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,302 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,302 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,302 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,303 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,303 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,303 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,304 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L75] char A [2 + 2 + 4 +1]; [L76] A[2 + 2 + 4] = 0 VAL [A={39:0}] [L77] CALL parse_expression_list (A) VAL [str={39:0}] [L49] int start=0, i=-1, j=-1; [L50] char str2[2]; VAL [i=-1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}] [L51] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}] [L53] i++ [L54] str[i] [L55] case 0: VAL [i=0, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=1] [L70] EXPR str[i] VAL [i=0, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=1] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] str[i] [L55] case 0: VAL [i=1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=36] [L70] EXPR str[i] VAL [i=1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=36] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] str[i] [L55] case 0: VAL [i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0] [L56] EXPR str[start] [L56] (str[start] == ' ') || (str[start] == '\t') [L56] EXPR str[start] [L56] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[start]=1, str[start]=1] [L56] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L57] EXPR str[start] VAL [i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[start]=1] [L57] COND FALSE !(str[start] == '"') [L58] j = i-1 VAL [i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L59] EXPR str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') [L59] EXPR str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36, str[j]=36] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36, str[j]=36] [L59] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L60] (0 < j) && (str[j] == '"') [L60] EXPR str[j] [L60] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36] [L60] COND FALSE !((0 < j) && (str[j] == '"')) [L61] COND TRUE start<=j [L63] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:59:37,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:59:37 BoogieIcfgContainer [2018-11-23 13:59:37,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:59:37,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:59:37,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:59:37,332 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:59:37,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:33" (3/4) ... [2018-11-23 13:59:37,337 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=38, |#NULL.offset|=35, |old(#NULL.base)|=38, |old(#NULL.offset)|=35] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=38, |old(#NULL.offset)|=35] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=38, |old(#NULL.offset)|=35] [?] RET #125#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9);call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=39, |main_~#A~0.offset|=0] [?] CALL call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0] [?] ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); VAL [parse_expression_list_~i~0=(- 1), parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !(~str.base == 0 && ~str.offset == 0); VAL [parse_expression_list_~i~0=(- 1), parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=1, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~switch3; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=1, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] havoc #t~mem2;havoc #t~switch3; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem0|=1, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !!(0 != #t~mem0);havoc #t~mem0; VAL [parse_expression_list_~i~0=0, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=36, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~switch3; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=36, |parse_expression_list_#t~switch3|=false, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] havoc #t~mem2;havoc #t~switch3; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem0|=36, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !!(0 != #t~mem0);havoc #t~mem0; VAL [parse_expression_list_~i~0=1, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1;call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch3 := 0 == #t~mem2; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume #t~switch3; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 32 == #t~mem4; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~mem4|=1, |parse_expression_list_#t~short6|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short6;call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short6 := 9 == #t~mem5; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~mem4|=1, |parse_expression_list_#t~mem5|=1, |parse_expression_list_#t~short6|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short6;havoc #t~short6;havoc #t~mem5;havoc #t~mem4; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~mem8|=1, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !(34 == #t~mem8);havoc #t~mem8; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=(- 1), parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] ~j~0 := ~i~0 - 1; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~short13 := 0 < ~j~0; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short13|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume #t~short13;call #t~mem10 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short12 := 32 == #t~mem10; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem10|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short12|=false, |parse_expression_list_#t~short13|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short12;call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short12 := 9 == #t~mem11; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem10|=36, |parse_expression_list_#t~mem11|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short12|=false, |parse_expression_list_#t~short13|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~short13 := #t~short12; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem10|=36, |parse_expression_list_#t~mem11|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short12|=false, |parse_expression_list_#t~short13|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short13;havoc #t~mem11;havoc #t~short13;havoc #t~mem10;havoc #t~short12; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] #t~short16 := 0 < ~j~0; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short16|=true, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume #t~short16;call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1);#t~short16 := 34 == #t~mem15; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem15|=36, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~short16|=false, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume !#t~short16;havoc #t~short16;havoc #t~mem15; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] assume ~start~0 <= ~j~0;call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0));havoc #t~ret18.base, #t~ret18.offset; VAL [parse_expression_list_~i~0=2, parse_expression_list_~j~0=1, parse_expression_list_~start~0=0, parse_expression_list_~str.base=39, parse_expression_list_~str.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |parse_expression_list_#in~str.base|=39, |parse_expression_list_#in~str.offset|=0, |parse_expression_list_#t~mem2|=0, |parse_expression_list_#t~switch3|=true, |parse_expression_list_~#str2~0.base|=37, |parse_expression_list_~#str2~0.offset|=0] [?] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=38, #NULL.offset=35, old(#NULL.base)=38, old(#NULL.offset)=35] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L75] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9); [L76] call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=39, ~#A~0.offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0] [L47-L72] ~str.base, ~str.offset := #in~str.base, #in~str.offset; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L51] assume !(~str.base == 0 && ~str.offset == 0); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=36, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] assume !(34 == #t~mem8); [L57] havoc #t~mem8; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume #t~short13; [L59] call #t~mem10 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short12; [L59] call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short13; [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume #t~short16; [L60] call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume !#t~short16; [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L61-L67] assume ~start~0 <= ~j~0; [L62] call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18.base, #t~ret18.offset; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=38, #NULL.offset=35, old(#NULL.base)=38, old(#NULL.offset)=35] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=38, old(#NULL.offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L75] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(9); [L76] call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=39, ~#A~0.offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0.base, ~#A~0.offset); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0] [L47-L72] ~str.base, ~str.offset := #in~str.base, #in~str.offset; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc(2); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L51] assume !(~str.base == 0 && ~str.offset == 0); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume !#t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L70] call #t~mem0 := read~int(~str.base, ~str.offset + ~i~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=36, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L52-L70] assume !!(0 != #t~mem0); [L70] havoc #t~mem0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L55] assume #t~switch3; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] call #t~mem4 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] call #t~mem5 := read~int(~str.base, ~str.offset + ~start~0, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L56] assume !#t~short6; [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] call #t~mem8 := read~int(~str.base, ~str.offset + ~start~0, 1); VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L57] assume !(34 == #t~mem8); [L57] havoc #t~mem8; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str.base=39, ~str.offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume #t~short13; [L59] call #t~mem10 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short12; [L59] call #t~mem11 := read~int(~str.base, ~str.offset + ~j~0, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L59] assume !#t~short13; [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume #t~short16; [L60] call #t~mem15 := read~int(~str.base, ~str.offset + ~j~0, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L60] assume !#t~short16; [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L61-L67] assume ~start~0 <= ~j~0; [L62] call #t~ret18.base, #t~ret18.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18.base, #t~ret18.offset; VAL [#in~str.base=39, #in~str.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0.base=37, ~#str2~0.offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str.base=39, ~str.offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- [2018-11-23 13:59:37,488 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,489 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,489 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,490 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,490 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,491 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,491 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,492 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-11-23 13:59:37,492 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=38, #NULL!offset=35, old(#NULL!base)=38, old(#NULL!offset)=35] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=38, old(#NULL!offset)=35] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L75] FCALL call ~#A~0 := #Ultimate.alloc(9); [L76] FCALL call write~int(0, { base: ~#A~0!base, offset: 8 + ~#A~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=39, ~#A~0!offset=0] [L77] CALL call #t~ret19 := parse_expression_list(~#A~0); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0] [L47-L72] ~str := #in~str; [L49] ~start~0 := 0; [L49] ~i~0 := -1; [L49] ~j~0 := -1; [L50] FCALL call ~#str2~0 := #Ultimate.alloc(2); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L51] COND FALSE !(~str == { base: 0, offset: 0 }) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=-1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=0, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND FALSE !(#t~switch3) VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=36, #t~switch3=false, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54] havoc #t~mem2; [L54-L69] havoc #t~switch3; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L70] FCALL call #t~mem0 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=36, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L52-L70] COND FALSE !(!(0 != #t~mem0)) [L70] havoc #t~mem0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=1, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L53] #t~post1 := ~i~0; [L53] ~i~0 := 1 + #t~post1; [L53] havoc #t~post1; [L54] FCALL call #t~mem2 := read~int({ base: ~str!base, offset: ~str!offset + ~i~0 }, 1); [L55] #t~switch3 := 0 == #t~mem2; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L54-L69] COND TRUE #t~switch3 VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] FCALL call #t~mem4 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 32 == #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND FALSE !(#t~short6) [L56] FCALL call #t~mem5 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); [L56] #t~short6 := 9 == #t~mem5; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem4=1, #t~mem5=1, #t~short6=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L56] COND TRUE !#t~short6 [L56] havoc #t~short6; [L56] havoc #t~mem5; [L56] havoc #t~mem4; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] FCALL call #t~mem8 := read~int({ base: ~str!base, offset: ~str!offset + ~start~0 }, 1); VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~mem8=1, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L57] COND FALSE !(34 == #t~mem8) [L57] havoc #t~mem8; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=-1, ~start~0=0, ~str!base=39, ~str!offset=0] [L58] ~j~0 := ~i~0 - 1; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE #t~short13 [L59] FCALL call #t~mem10 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 32 == #t~mem10; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND FALSE !(#t~short12) [L59] FCALL call #t~mem11 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L59] #t~short12 := 9 == #t~mem11; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] #t~short13 := #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem10=36, #t~mem11=36, #t~mem2=0, #t~short12=false, #t~short13=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L59] COND TRUE !#t~short13 [L59] havoc #t~mem11; [L59] havoc #t~short13; [L59] havoc #t~mem10; [L59] havoc #t~short12; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] #t~short16 := 0 < ~j~0; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~short16=true, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND TRUE #t~short16 [L60] FCALL call #t~mem15 := read~int({ base: ~str!base, offset: ~str!offset + ~j~0 }, 1); [L60] #t~short16 := 34 == #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem15=36, #t~mem2=0, #t~short16=false, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L60] COND FALSE !(#t~short16) [L60] havoc #t~short16; [L60] havoc #t~mem15; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L61] COND TRUE ~start~0 <= ~j~0 [L62] FCALL call #t~ret18 := r_strncpy(~#str2~0, { base: ~str!base, offset: ~str!offset + ~start~0 }, 1 + (~j~0 - ~start~0)); [L62] havoc #t~ret18; VAL [#in~str!base=39, #in~str!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=0, #t~switch3=true, ~#str2~0!base=37, ~#str2~0!offset=0, ~i~0=2, ~j~0=1, ~start~0=0, ~str!base=39, ~str!offset=0] [L63] CALL call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L75] char A [2 + 2 + 4 +1]; [L76] A[2 + 2 + 4] = 0 VAL [A={39:0}] [L77] CALL parse_expression_list (A) VAL [str={39:0}] [L49] int start=0, i=-1, j=-1; [L50] char str2[2]; VAL [i=-1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}] [L51] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}] [L53] i++ [L54] str[i] [L55] case 0: VAL [i=0, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=1] [L70] EXPR str[i] VAL [i=0, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=1] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] str[i] [L55] case 0: VAL [i=1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=36] [L70] EXPR str[i] VAL [i=1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=36] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] str[i] [L55] case 0: VAL [i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0] [L56] EXPR str[start] [L56] (str[start] == ' ') || (str[start] == '\t') [L56] EXPR str[start] [L56] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[start]=1, str[start]=1] [L56] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L57] EXPR str[start] VAL [i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[start]=1] [L57] COND FALSE !(str[start] == '"') [L58] j = i-1 VAL [i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L59] EXPR str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') [L59] EXPR str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36, str[j]=36] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36, str[j]=36] [L59] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L60] (0 < j) && (str[j] == '"') [L60] EXPR str[j] [L60] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36] [L60] COND FALSE !((0 < j) && (str[j] == '"')) [L61] COND TRUE start<=j [L63] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:59:37,575 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_025a6ecc-1e8e-4967-8a86-7e39bda1c57e/bin-2019/uautomizer/witness.graphml [2018-11-23 13:59:37,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:59:37,576 INFO L168 Benchmark]: Toolchain (without parser) took 4300.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 958.6 MB in the beginning and 968.5 MB in the end (delta: -10.0 MB). Peak memory consumption was 200.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:59:37,577 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:59:37,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.61 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 945.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:59:37,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:59:37,578 INFO L168 Benchmark]: Boogie Preprocessor took 30.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:59:37,578 INFO L168 Benchmark]: RCFGBuilder took 286.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:59:37,579 INFO L168 Benchmark]: TraceAbstraction took 3457.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 979.0 MB in the end (delta: 133.2 MB). Peak memory consumption was 203.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:59:37,579 INFO L168 Benchmark]: Witness Printer took 243.62 ms. Allocated memory is still 1.2 GB. Free memory was 979.0 MB in the beginning and 968.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:59:37,586 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 206.61 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 945.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 286.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3457.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 979.0 MB in the end (delta: 133.2 MB). Peak memory consumption was 203.4 MB. Max. memory is 11.5 GB. * Witness Printer took 243.62 ms. Allocated memory is still 1.2 GB. Free memory was 979.0 MB in the beginning and 968.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch3 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L75] char A [2 + 2 + 4 +1]; [L76] A[2 + 2 + 4] = 0 VAL [A={39:0}] [L77] CALL parse_expression_list (A) VAL [str={39:0}] [L49] int start=0, i=-1, j=-1; [L50] char str2[2]; VAL [i=-1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}] [L51] COND FALSE !(!str) VAL [i=-1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}] [L53] i++ [L54] str[i] [L55] case 0: VAL [i=0, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=1] [L70] EXPR str[i] VAL [i=0, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=1] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] str[i] [L55] case 0: VAL [i=1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=36] [L70] EXPR str[i] VAL [i=1, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=36] [L70] COND TRUE str[i] != 0 [L53] i++ [L54] str[i] [L55] case 0: VAL [i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0] [L56] EXPR str[start] [L56] (str[start] == ' ') || (str[start] == '\t') [L56] EXPR str[start] [L56] (str[start] == ' ') || (str[start] == '\t') VAL [(str[start] == ' ') || (str[start] == '\t')=0, i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[start]=1, str[start]=1] [L56] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L57] EXPR str[start] VAL [i=2, j=-1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[start]=1] [L57] COND FALSE !(str[start] == '"') [L58] j = i-1 VAL [i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L59] EXPR str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') [L59] EXPR str[j] [L59] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=1, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36, str[j]=36] [L59] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [(0 < j) && ((str[j] == ' ') || (str[j] == '\t'))=0, (str[j] == ' ') || (str[j] == '\t')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36, str[j]=36] [L59] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L60] (0 < j) && (str[j] == '"') [L60] EXPR str[j] [L60] (0 < j) && (str[j] == '"') VAL [(0 < j) && (str[j] == '"')=0, i=2, j=1, start=0, str={39:0}, str={39:0}, str2={37:0}, str[i]=0, str[j]=36] [L60] COND FALSE !((0 < j) && (str[j] == '"')) [L61] COND TRUE start<=j [L63] CALL __VERIFIER_assert(j - start + 1 < 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 537 SDtfs, 986 SDslu, 1838 SDs, 0 SdLazy, 1378 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 154 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 279 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 69566 SizeOfPredicates, 11 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 6/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...