./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.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_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d36d9c90d70f68ab71543f184cd64aeaf02e524 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:39:39,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:39:39,533 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:39:39,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:39:39,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:39:39,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:39:39,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:39:39,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:39:39,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:39:39,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:39:39,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:39:39,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:39:39,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:39:39,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:39:39,548 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:39:39,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:39:39,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:39:39,550 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:39:39,551 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:39:39,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:39:39,553 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:39:39,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:39:39,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:39:39,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:39:39,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:39:39,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:39:39,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:39:39,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:39:39,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:39:39,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:39:39,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:39:39,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:39:39,559 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:39:39,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:39:39,560 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:39:39,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:39:39,561 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:39:39,571 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:39:39,571 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:39:39,572 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:39:39,572 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:39:39,572 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:39:39,572 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:39:39,572 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:39:39,572 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:39:39,573 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:39:39,573 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:39:39,573 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:39:39,573 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:39:39,573 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:39:39,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:39:39,574 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:39:39,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:39:39,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:39:39,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:39:39,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:39:39,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:39:39,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:39:39,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:39:39,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:39:39,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:39:39,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:39:39,577 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:39:39,577 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:39:39,578 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:39:39,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:39:39,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:39:39,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:39:39,578 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan 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 -> Taipan 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 -> 1d36d9c90d70f68ab71543f184cd64aeaf02e524 [2018-11-23 13:39:39,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:39:39,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:39:39,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:39:39,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:39:39,614 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:39:39,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:39:39,657 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/data/dc201b0ad/3b6cf4508862420190cd64aa495fb17e/FLAG49812fd83 [2018-11-23 13:39:40,111 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:39:40,111 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/sv-benchmarks/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:39:40,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/data/dc201b0ad/3b6cf4508862420190cd64aa495fb17e/FLAG49812fd83 [2018-11-23 13:39:40,126 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/data/dc201b0ad/3b6cf4508862420190cd64aa495fb17e [2018-11-23 13:39:40,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:39:40,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:39:40,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:39:40,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:39:40,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:39:40,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5846bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40, skipping insertion in model container [2018-11-23 13:39:40,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:39:40,166 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:39:40,354 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:39:40,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:39:40,424 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:39:40,456 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:39:40,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40 WrapperNode [2018-11-23 13:39:40,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:39:40,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:39:40,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:39:40,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:39:40,462 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:39:40" (1/1) ... [2018-11-23 13:39:40,470 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:39:40" (1/1) ... [2018-11-23 13:39:40,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:39:40,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:39:40,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:39:40,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:39:40,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... [2018-11-23 13:39:40,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:39:40,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:39:40,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:39:40,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:39:40,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/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:39:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 13:39:40,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 13:39:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:39:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 13:39:40,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 13:39:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:39:40,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:39:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 13:39:40,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 13:39:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:39:40,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:39:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:39:40,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:39:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:39:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:39:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:39:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:39:40,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:39:40,696 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:39:40,696 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:39:40,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:39:40 BoogieIcfgContainer [2018-11-23 13:39:40,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:39:40,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:39:40,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:39:40,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:39:40,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:39:40" (1/3) ... [2018-11-23 13:39:40,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc6a69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:39:40, skipping insertion in model container [2018-11-23 13:39:40,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:40" (2/3) ... [2018-11-23 13:39:40,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc6a69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:39:40, skipping insertion in model container [2018-11-23 13:39:40,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:39:40" (3/3) ... [2018-11-23 13:39:40,702 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:39:40,708 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:39:40,712 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:39:40,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:39:40,738 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:39:40,738 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:39:40,738 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:39:40,738 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:39:40,738 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:39:40,739 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:39:40,739 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:39:40,739 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:39:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 13:39:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:39:40,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:40,754 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] [2018-11-23 13:39:40,756 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:40,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2078522992, now seen corresponding path program 1 times [2018-11-23 13:39:40,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:40,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:40,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:39:40,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:40,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:40,843 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:39:40,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:39:40,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:39:40,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:39:40,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:39:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:39:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:39:40,857 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 13:39:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:39:40,877 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 13:39:40,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:39:40,878 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 13:39:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:39:40,885 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:39:40,885 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:39:40,887 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:39:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:39:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:39:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:39:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 13:39:40,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2018-11-23 13:39:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:39:40,917 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 13:39:40,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:39:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:39:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:39:40,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:40,918 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] [2018-11-23 13:39:40,918 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:40,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 308454869, now seen corresponding path program 1 times [2018-11-23 13:39:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:40,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:39:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:40,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:41,001 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:39:41,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:39:41,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:39:41,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:39:41,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:39:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:39:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:39:41,003 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-11-23 13:39:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:39:41,072 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 13:39:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:39:41,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 13:39:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:39:41,073 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:39:41,073 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:39:41,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:39:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:39:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 13:39:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:39:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 13:39:41,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2018-11-23 13:39:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:39:41,077 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 13:39:41,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:39:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:39:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:39:41,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:41,078 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:39:41,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:41,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1526105051, now seen corresponding path program 1 times [2018-11-23 13:39:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:39:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:41,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:39:41,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:39:41,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:39:41,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:39:41,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:39:41,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:39:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:39:41,169 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2018-11-23 13:39:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:39:41,234 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 13:39:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:39:41,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 13:39:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:39:41,235 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:39:41,235 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:39:41,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:39:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:39:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 13:39:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:39:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 13:39:41,239 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2018-11-23 13:39:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:39:41,240 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 13:39:41,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:39:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:39:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:39:41,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:41,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:39:41,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:41,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:41,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1811609727, now seen corresponding path program 1 times [2018-11-23 13:39:41,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:41,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:39:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:41,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:39:41,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:39:41,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:39:41,296 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-23 13:39:41,297 INFO L202 CegarAbsIntRunner]: [5], [6], [21], [28], [30], [36], [38], [42], [43], [47], [52], [55], [61], [68], [70], [73], [78], [81], [88], [90], [94], [95], [98], [99], [100], [102], [103], [104], [105] [2018-11-23 13:39:41,326 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 13:39:41,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 13:39:41,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 13:39:41,516 INFO L272 AbstractInterpreter]: Visited 29 different actions 61 times. Merged at 12 different actions 27 times. Widened at 1 different actions 1 times. Performed 440 root evaluator evaluations with a maximum evaluation depth of 3. Performed 440 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 13:39:41,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:41,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 13:39:41,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:39:41,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/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:39:41,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:39:41,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 13:39:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:41,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:39:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:39:41,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:39:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:39:41,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:39:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-11-23 13:39:41,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:39:41,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:39:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:39:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:39:41,696 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-11-23 13:39:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:39:41,736 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 13:39:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:39:41,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-23 13:39:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:39:41,738 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:39:41,738 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:39:41,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:39:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:39:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:39:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:39:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 13:39:41,743 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2018-11-23 13:39:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:39:41,743 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 13:39:41,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:39:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 13:39:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:39:41,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:41,744 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:39:41,744 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:41,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1815186809, now seen corresponding path program 2 times [2018-11-23 13:39:41,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:41,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:39:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:41,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:39:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:39:41,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:39:41,857 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:39:41,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:39:41,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:39:41,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/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:39:41,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:39:41,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:39:41,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:39:41,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:39:41,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:39:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:39:41,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:39:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:39:42,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:39:42,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2018-11-23 13:39:42,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:39:42,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:39:42,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:39:42,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:39:42,098 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 16 states. [2018-11-23 13:39:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:39:42,316 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-23 13:39:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:39:42,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 13:39:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:39:42,317 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:39:42,317 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:39:42,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:39:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:39:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 13:39:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:39:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 13:39:42,321 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 32 [2018-11-23 13:39:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:39:42,322 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 13:39:42,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:39:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 13:39:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:39:42,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:42,323 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-23 13:39:42,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:42,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1302029915, now seen corresponding path program 3 times [2018-11-23 13:39:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:42,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:39:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:42,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:39:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:39:42,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:39:42,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:39:42,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:39:42,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:39:42,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:39:42,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/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:39:42,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:39:42,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 13:39:42,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:39:42,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:39:42,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:39:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:39:42,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:39:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:39:42,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:39:42,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-11-23 13:39:42,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:39:42,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:39:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:39:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:39:42,526 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-11-23 13:39:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:39:42,587 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 13:39:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:39:42,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 13:39:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:39:42,590 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:39:42,590 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:39:42,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:39:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:39:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-23 13:39:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:39:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 13:39:42,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 36 [2018-11-23 13:39:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:39:42,600 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 13:39:42,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:39:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 13:39:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:39:42,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:39:42,601 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:39:42,601 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:39:42,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:39:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -168004351, now seen corresponding path program 4 times [2018-11-23 13:39:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:39:42,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:42,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:39:42,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:39:42,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:39:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:39:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:39:42,649 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=9, |#NULL.offset|=6, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] RET #99#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~len~1 := 2; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] #t~short8 := ~len~1 < 32; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=true] [?] assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet7|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~nondet7;havoc #t~short8; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(~len > 0); VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume true; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] RET #103#return; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10.base|=8, |main_#t~ret10.offset|=0] [?] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; VAL [sll_length_~head.base=8, sll_length_~head.offset=0, sll_length_~len~0=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=7, sll_length_~head.offset=0, sll_length_~len~0=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=5, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !(~head.base != 0 || ~head.offset != 0); VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] #res := ~len~0; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] assume true; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] RET #105#return; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume ~len~1 != #t~ret11;havoc #t~ret11; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L574] return head; VAL [\old(len)=3, \result={8:0}, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={8:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={8:0}] [L577] int len = 0; VAL [head={8:0}, head={8:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={8:0}, len=3] [L582] return len; VAL [\result=3, head={0:0}, head={8:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={8:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={8:0}] ----- [2018-11-23 13:39:42,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:39:42 BoogieIcfgContainer [2018-11-23 13:39:42,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:39:42,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:39:42,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:39:42,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:39:42,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:39:40" (3/4) ... [2018-11-23 13:39:42,712 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|=9, |#NULL.offset|=6, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] RET #99#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~len~1 := 2; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] #t~short8 := ~len~1 < 32; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=true] [?] assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet7|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~nondet7;havoc #t~short8; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(~len > 0); VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume true; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] RET #103#return; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10.base|=8, |main_#t~ret10.offset|=0] [?] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; VAL [sll_length_~head.base=8, sll_length_~head.offset=0, sll_length_~len~0=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=7, sll_length_~head.offset=0, sll_length_~len~0=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=5, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !(~head.base != 0 || ~head.offset != 0); VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] #res := ~len~0; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] assume true; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] RET #105#return; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume ~len~1 != #t~ret11;havoc #t~ret11; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L574] return head; VAL [\old(len)=3, \result={8:0}, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={8:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={8:0}] [L577] int len = 0; VAL [head={8:0}, head={8:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={8:0}, len=3] [L582] return len; VAL [\result=3, head={8:0}, head={0:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={8:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={8:0}] ----- [2018-11-23 13:39:42,871 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a2b3ba00-417f-46c3-9c1b-0127eac2dd4c/bin-2019/utaipan/witness.graphml [2018-11-23 13:39:42,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:39:42,871 INFO L168 Benchmark]: Toolchain (without parser) took 2743.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:39:42,872 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:39:42,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:42,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.42 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:39:42,879 INFO L168 Benchmark]: Boogie Preprocessor took 17.51 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:42,879 INFO L168 Benchmark]: RCFGBuilder took 204.30 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:42,880 INFO L168 Benchmark]: TraceAbstraction took 2012.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -75.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:39:42,880 INFO L168 Benchmark]: Witness Printer took 160.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:42,882 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.42 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. * Boogie Preprocessor took 17.51 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.30 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2012.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -75.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 160.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L574] return head; VAL [\old(len)=3, \result={8:0}, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={8:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={8:0}] [L577] int len = 0; VAL [head={8:0}, head={8:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={8:0}, len=3] [L582] return len; VAL [\result=3, head={0:0}, head={8:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={8:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 43 locations, 1 error locations. UNSAFE Result, 1.9s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 79 SDslu, 685 SDs, 0 SdLazy, 401 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 180 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 307 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 29004 SizeOfPredicates, 6 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 44/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...