./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-01_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_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/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 b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:09:36,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:09:36,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:09:36,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:09:36,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:09:36,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:09:36,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:09:36,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:09:36,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:09:36,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:09:36,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:09:36,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:09:36,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:09:36,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:09:36,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:09:36,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:09:36,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:09:36,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:09:36,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:09:36,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:09:36,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:09:36,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:09:36,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:09:36,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:09:36,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:09:36,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:09:36,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:09:36,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:09:36,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:09:36,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:09:36,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:09:36,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:09:36,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:09:36,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:09:36,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:09:36,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:09:36,294 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:09:36,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:09:36,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:09:36,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:09:36,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:09:36,302 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:09:36,302 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:09:36,303 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:09:36,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:09:36,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:09:36,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:09:36,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:09:36,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:09:36,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:09:36,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:09:36,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:09:36,306 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:09:36,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:09:36,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:09:36,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:09:36,307 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_494afd1f-1df5-426d-beff-5d8b85762263/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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2018-11-23 12:09:36,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:09:36,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:09:36,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:09:36,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:09:36,345 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:09:36,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:09:36,381 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/data/f8ebbf3ba/d6c7f3c38b824da397bb8edcb48ca246/FLAGea420523a [2018-11-23 12:09:36,831 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:09:36,832 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:09:36,841 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/data/f8ebbf3ba/d6c7f3c38b824da397bb8edcb48ca246/FLAGea420523a [2018-11-23 12:09:36,850 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/data/f8ebbf3ba/d6c7f3c38b824da397bb8edcb48ca246 [2018-11-23 12:09:36,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:09:36,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:09:36,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:36,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:09:36,856 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:09:36,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:36" (1/1) ... [2018-11-23 12:09:36,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe0e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:36, skipping insertion in model container [2018-11-23 12:09:36,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:36" (1/1) ... [2018-11-23 12:09:36,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:09:36,893 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:09:37,089 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:37,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:09:37,169 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:37,200 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:09:37,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37 WrapperNode [2018-11-23 12:09:37,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:37,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:37,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:09:37,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:09:37,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:37,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:09:37,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:09:37,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:09:37,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... [2018-11-23 12:09:37,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:09:37,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:09:37,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:09:37,245 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:09:37,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/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 12:09:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:09:37,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:09:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:09:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:09:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:09:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:09:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:09:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:09:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:09:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:09:37,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:09:37,621 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-23 12:09:37,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:37 BoogieIcfgContainer [2018-11-23 12:09:37,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:09:37,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:09:37,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:09:37,624 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:09:37,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:09:36" (1/3) ... [2018-11-23 12:09:37,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdd65b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:37, skipping insertion in model container [2018-11-23 12:09:37,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:37" (2/3) ... [2018-11-23 12:09:37,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdd65b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:37, skipping insertion in model container [2018-11-23 12:09:37,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:37" (3/3) ... [2018-11-23 12:09:37,626 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:09:37,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:09:37,639 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-23 12:09:37,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-23 12:09:37,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:09:37,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:09:37,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:09:37,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:09:37,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:09:37,670 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:09:37,670 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:09:37,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:09:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-11-23 12:09:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:09:37,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:37,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:37,690 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:37,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1861451205, now seen corresponding path program 1 times [2018-11-23 12:09:37,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:37,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:37,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:37,796 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 12:09:37,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:37,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:37,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:37,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:37,809 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2018-11-23 12:09:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:37,852 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2018-11-23 12:09:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:37,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 12:09:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:37,860 INFO L225 Difference]: With dead ends: 186 [2018-11-23 12:09:37,860 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:09:37,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:09:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2018-11-23 12:09:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:09:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-11-23 12:09:37,890 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2018-11-23 12:09:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:37,890 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-11-23 12:09:37,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 12:09:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:09:37,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:37,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:37,891 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:37,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash -276606363, now seen corresponding path program 1 times [2018-11-23 12:09:37,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:37,929 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 12:09:37,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:37,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:37,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:37,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:37,931 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2018-11-23 12:09:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:37,955 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-23 12:09:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:37,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:09:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:37,956 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:09:37,956 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:09:37,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:09:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 12:09:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:09:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-23 12:09:37,964 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2018-11-23 12:09:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:37,964 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-23 12:09:37,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-11-23 12:09:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:09:37,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:37,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:37,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:37,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -276604441, now seen corresponding path program 1 times [2018-11-23 12:09:37,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:37,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,016 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 12:09:38,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:09:38,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:09:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:09:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:38,017 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2018-11-23 12:09:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,066 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:09:38,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:38,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:09:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,067 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:09:38,067 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:09:38,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:09:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-23 12:09:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:09:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-11-23 12:09:38,073 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2018-11-23 12:09:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,073 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-11-23 12:09:38,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:09:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-23 12:09:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:09:38,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:38,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash -960000523, now seen corresponding path program 1 times [2018-11-23 12:09:38,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,144 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 12:09:38,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:09:38,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:09:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:09:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:38,145 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2018-11-23 12:09:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,248 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2018-11-23 12:09:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:38,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:09:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,249 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:09:38,249 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 12:09:38,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 12:09:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2018-11-23 12:09:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:09:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-11-23 12:09:38,255 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2018-11-23 12:09:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,255 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-11-23 12:09:38,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:09:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 12:09:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:09:38,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:38,257 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1769347149, now seen corresponding path program 1 times [2018-11-23 12:09:38,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,313 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 12:09:38,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:09:38,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:09:38,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:09:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:38,315 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2018-11-23 12:09:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,414 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-11-23 12:09:38,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:09:38,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:09:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,415 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:09:38,415 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 12:09:38,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:09:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 12:09:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2018-11-23 12:09:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:09:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-23 12:09:38,422 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2018-11-23 12:09:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,422 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-23 12:09:38,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:09:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-23 12:09:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:09:38,423 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,423 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] [2018-11-23 12:09:38,423 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 984817432, now seen corresponding path program 1 times [2018-11-23 12:09:38,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,466 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 12:09:38,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:09:38,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:09:38,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:09:38,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:38,467 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-11-23 12:09:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,513 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 12:09:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:38,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:09:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,515 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:09:38,515 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 12:09:38,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 12:09:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2018-11-23 12:09:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:09:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-23 12:09:38,521 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2018-11-23 12:09:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,522 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-23 12:09:38,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:09:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 12:09:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:09:38,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:38,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1725931075, now seen corresponding path program 1 times [2018-11-23 12:09:38,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,560 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 12:09:38,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:38,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:38,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:38,561 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2018-11-23 12:09:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,572 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-11-23 12:09:38,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:38,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:09:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,573 INFO L225 Difference]: With dead ends: 141 [2018-11-23 12:09:38,573 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:09:38,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:09:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-11-23 12:09:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:09:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-11-23 12:09:38,578 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2018-11-23 12:09:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,579 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-11-23 12:09:38,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-11-23 12:09:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:09:38,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,580 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 12:09:38,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1964251274, now seen corresponding path program 1 times [2018-11-23 12:09:38,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,614 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 12:09:38,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:38,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:38,615 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2018-11-23 12:09:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,625 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-23 12:09:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:38,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:09:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,627 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:09:38,627 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:09:38,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:09:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 12:09:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:09:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-23 12:09:38,632 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2018-11-23 12:09:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,633 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-23 12:09:38,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-23 12:09:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:09:38,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,634 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] [2018-11-23 12:09:38,634 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash 639264193, now seen corresponding path program 1 times [2018-11-23 12:09:38,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,660 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 12:09:38,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:38,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:38,661 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 3 states. [2018-11-23 12:09:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,677 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-23 12:09:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:38,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:09:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,678 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:09:38,678 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:09:38,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:09:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-23 12:09:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:09:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-11-23 12:09:38,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 27 [2018-11-23 12:09:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,684 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-11-23 12:09:38,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-11-23 12:09:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:09:38,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,684 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] [2018-11-23 12:09:38,685 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 639266115, now seen corresponding path program 1 times [2018-11-23 12:09:38,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,725 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 12:09:38,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:09:38,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:09:38,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:09:38,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:38,726 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 4 states. [2018-11-23 12:09:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,778 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-23 12:09:38,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:38,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 12:09:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,779 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:09:38,779 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:09:38,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:09:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:09:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:09:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-23 12:09:38,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2018-11-23 12:09:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,785 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-23 12:09:38,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:09:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-23 12:09:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:09:38,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,786 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 12:09:38,786 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1915606920, now seen corresponding path program 1 times [2018-11-23 12:09:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,853 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 12:09:38,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:38,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:09:38,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:38,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:09:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:09:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:38,854 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2018-11-23 12:09:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:38,974 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-11-23 12:09:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:09:38,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 12:09:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:38,975 INFO L225 Difference]: With dead ends: 179 [2018-11-23 12:09:38,976 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:09:38,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:09:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2018-11-23 12:09:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:09:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-11-23 12:09:38,982 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2018-11-23 12:09:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:38,983 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-11-23 12:09:38,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:09:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-11-23 12:09:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:09:38,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:38,984 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 12:09:38,984 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:38,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2016202760, now seen corresponding path program 1 times [2018-11-23 12:09:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:38,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:39,213 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 12:09:39,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:39,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:09:39,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:39,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:09:39,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:09:39,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:09:39,214 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2018-11-23 12:09:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:39,573 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2018-11-23 12:09:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:09:39,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:09:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:39,575 INFO L225 Difference]: With dead ends: 188 [2018-11-23 12:09:39,575 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 12:09:39,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:09:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 12:09:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2018-11-23 12:09:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:09:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-11-23 12:09:39,584 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 28 [2018-11-23 12:09:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:39,584 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-11-23 12:09:39,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:09:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-11-23 12:09:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:09:39,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:39,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:39,585 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:39,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1003425070, now seen corresponding path program 1 times [2018-11-23 12:09:39,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:39,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:39,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:39,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:39,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:39,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:39,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:09:39,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:39,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:09:39,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:09:39,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:39,629 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 5 states. [2018-11-23 12:09:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:39,719 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-11-23 12:09:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:09:39,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 12:09:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:39,720 INFO L225 Difference]: With dead ends: 162 [2018-11-23 12:09:39,721 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 12:09:39,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 12:09:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-11-23 12:09:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:09:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-11-23 12:09:39,730 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 30 [2018-11-23 12:09:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:39,730 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-11-23 12:09:39,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:09:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-11-23 12:09:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:09:39,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:39,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:39,732 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:39,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1179896658, now seen corresponding path program 1 times [2018-11-23 12:09:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:39,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:39,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:39,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:09:39,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:39,756 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 3 states. [2018-11-23 12:09:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:39,800 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2018-11-23 12:09:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:39,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 12:09:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:39,802 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:09:39,803 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 12:09:39,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 12:09:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-23 12:09:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 12:09:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2018-11-23 12:09:39,813 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 30 [2018-11-23 12:09:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:39,813 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2018-11-23 12:09:39,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2018-11-23 12:09:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:09:39,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:39,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:39,815 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:39,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash 425326620, now seen corresponding path program 1 times [2018-11-23 12:09:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:09:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:39,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:09:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:09:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:09:39,850 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=15, |#NULL.offset|=13, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] RET #331#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret28 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=16, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume #t~short7; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=16, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~nondet8|=0] [?] assume !(0 != #t~nondet8);havoc #t~nondet8; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume 0 == ~len~0;~len~0 := 1; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem20.base|=0, |main_#t~mem20.offset|=0] [?] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem21.base|=0, |main_#t~mem21.offset|=0] [?] assume !(0 != #t~mem21.base || 0 != #t~mem21.offset);havoc #t~mem21.base, #t~mem21.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !(0 != #t~nondet1); [L995] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4); [L995] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L995] havoc #t~mem3.base, #t~mem3.offset; [L995] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4); [L995] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!#t~short7; [L995] havoc #t~mem6.base, #t~mem6.offset; [L995] havoc #t~short7; [L995] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000-L1009] assume !(0 != #t~nondet8); [L1000] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1011] ~end~0.base, ~end~0.offset := 0, 0; [L1012] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1015] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1017-L1035] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1019] ~len~0 := 0; [L1020] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); [L1020] ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; [L1020] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1021-L1031] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1023-L1026] assume 0 == ~len~0; [L1024] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1027] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1028] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assume !(0 != #t~mem21.base || 0 != #t~mem21.offset); [L1029] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !(0 != #t~nondet1); [L995] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4); [L995] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L995] havoc #t~mem3.base, #t~mem3.offset; [L995] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4); [L995] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!#t~short7; [L995] havoc #t~mem6.base, #t~mem6.offset; [L995] havoc #t~short7; [L995] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000-L1009] assume !(0 != #t~nondet8); [L1000] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1011] ~end~0.base, ~end~0.offset := 0, 0; [L1012] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1015] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1017-L1035] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1019] ~len~0 := 0; [L1020] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); [L1020] ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; [L1020] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1021-L1031] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1023-L1026] assume 0 == ~len~0; [L1024] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1027] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1028] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assume !(0 != #t~mem21.base || 0 != #t~mem21.offset); [L1029] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={16:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={16:0}, len=0, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] EXPR inner->inner VAL [end={14:0}, inner={16:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={14:0}, inner={16:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] ----- [2018-11-23 12:09:39,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:09:39 BoogieIcfgContainer [2018-11-23 12:09:39,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:09:39,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:09:39,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:09:39,900 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:09:39,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:37" (3/4) ... [2018-11-23 12:09:39,902 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|=15, |#NULL.offset|=13, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] RET #331#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret28 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=16, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume #t~short7; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=16, |main_#t~mem5.offset|=0, |main_#t~short7|=true] [?] assume !!#t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~nondet8|=0] [?] assume !(0 != #t~nondet8);havoc #t~nondet8; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=0, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume 0 == ~len~0;~len~0 := 1; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem20.base|=0, |main_#t~mem20.offset|=0] [?] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0, |main_#t~mem21.base|=0, |main_#t~mem21.offset|=0] [?] assume !(0 != #t~mem21.base || 0 != #t~mem21.offset);havoc #t~mem21.base, #t~mem21.offset; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~end~0.base=14, main_~end~0.offset=0, main_~inner~0.base=16, main_~inner~0.offset=0, main_~len~0=1, main_~list~0.base=14, main_~list~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=16, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !(0 != #t~nondet1); [L995] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4); [L995] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L995] havoc #t~mem3.base, #t~mem3.offset; [L995] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4); [L995] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!#t~short7; [L995] havoc #t~mem6.base, #t~mem6.offset; [L995] havoc #t~short7; [L995] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000-L1009] assume !(0 != #t~nondet8); [L1000] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1011] ~end~0.base, ~end~0.offset := 0, 0; [L1012] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1015] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1017-L1035] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1019] ~len~0 := 0; [L1020] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); [L1020] ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; [L1020] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1021-L1031] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1023-L1026] assume 0 == ~len~0; [L1024] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1027] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1028] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assume !(0 != #t~mem21.base || 0 != #t~mem21.offset); [L1029] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!(~list~0.base != 0 || ~list~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~list~0.base=14, ~list~0.offset=0] [L995] assume !(0 != #t~nondet1); [L995] havoc #t~nondet1; [L995] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12); [L995] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4); [L995] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); [L995] havoc #t~mem3.base, #t~mem3.offset; [L995] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4); [L995] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L995] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); [L995] #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume #t~short7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem5.base=16, #t~mem5.offset=0, #t~short7=true, ~list~0.base=14, ~list~0.offset=0] [L995] assume !!#t~short7; [L995] havoc #t~mem6.base, #t~mem6.offset; [L995] havoc #t~short7; [L995] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~list~0.base=14, ~list~0.offset=0] [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~nondet8=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1000-L1009] assume !(0 != #t~nondet8); [L1000] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1011] ~end~0.base, ~end~0.offset := 0, 0; [L1012] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1015] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~list~0.base=14, ~list~0.offset=0] [L1017-L1035] assume !!(0 != ~end~0.base || 0 != ~end~0.offset); [L1019] ~len~0 := 0; [L1020] call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); [L1020] ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; [L1020] havoc #t~mem19.base, #t~mem19.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1021-L1031] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=0, ~list~0.base=14, ~list~0.offset=0] [L1023-L1026] assume 0 == ~len~0; [L1024] ~len~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1027] assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem20.base=0, #t~mem20.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1028] assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); [L1028] havoc #t~mem20.base, #t~mem20.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, #t~mem21.base=0, #t~mem21.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assume !(0 != #t~mem21.base || 0 != #t~mem21.offset); [L1029] havoc #t~mem21.base, #t~mem21.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [L1029] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=16, #t~malloc2.offset=0, ~end~0.base=14, ~end~0.offset=0, ~inner~0.base=16, ~inner~0.offset=0, ~len~0=1, ~list~0.base=14, ~list~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret28 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!(~list~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(0 != #t~nondet1) [L995] havoc #t~nondet1; [L995] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L995] FCALL call write~$Pointer$(#t~malloc2, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call #t~mem3 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem3!base, offset: #t~mem3!offset }, 4); [L995] havoc #t~mem3; [L995] FCALL call #t~mem4 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: #t~mem4!base, offset: 8 + #t~mem4!offset }, 4); [L995] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L995] FCALL call #t~mem5 := read~$Pointer$({ base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L995] #t~short7 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND TRUE #t~short7 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem5!base=16, #t~mem5!offset=0, #t~short7=true, ~list~0!base=14, ~list~0!offset=0] [L995] COND FALSE !(!#t~short7) [L995] havoc #t~mem6; [L995] havoc #t~short7; [L995] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~list~0!base=14, ~list~0!offset=0] [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000] assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~nondet8=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1000-L1009] COND TRUE !(0 != #t~nondet8) [L1000] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1011] ~end~0 := { base: 0, offset: 0 }; [L1012] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1015] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~list~0!base=14, ~list~0!offset=0] [L1017-L1035] COND FALSE !(!({ base: 0, offset: 0 } != ~end~0)) [L1019] ~len~0 := 0; [L1020] FCALL call #t~mem19 := read~$Pointer$({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1020] ~inner~0 := #t~mem19; [L1020] havoc #t~mem19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1021-L1031] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=0, ~list~0!base=14, ~list~0!offset=0] [L1023] COND TRUE 0 == ~len~0 [L1024] ~len~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1027] COND FALSE !(!({ base: 0, offset: 0 } != ~inner~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] FCALL call #t~mem20 := read~$Pointer$({ base: ~inner~0!base, offset: 8 + ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem20!base=0, #t~mem20!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1028] COND FALSE !(!({ base: 0, offset: 0 } == #t~mem20)) [L1028] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] FCALL call #t~mem21 := read~$Pointer$({ base: ~inner~0!base, offset: ~inner~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, #t~mem21!base=0, #t~mem21!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] COND TRUE !({ base: 0, offset: 0 } != #t~mem21) [L1029] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L1029] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=16, #t~malloc2!offset=0, ~end~0!base=14, ~end~0!offset=0, ~inner~0!base=16, ~inner~0!offset=0, ~len~0=1, ~list~0!base=14, ~list~0!offset=0] [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={16:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={16:0}, len=0, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] EXPR inner->inner VAL [end={14:0}, inner={16:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={14:0}, inner={16:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] ----- [2018-11-23 12:09:40,091 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_494afd1f-1df5-426d-beff-5d8b85762263/bin-2019/utaipan/witness.graphml [2018-11-23 12:09:40,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:09:40,092 INFO L168 Benchmark]: Toolchain (without parser) took 3238.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 967.7 MB in the end (delta: -11.1 MB). Peak memory consumption was 128.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:09:40,093 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:09:40,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:09:40,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:09:40,094 INFO L168 Benchmark]: Boogie Preprocessor took 25.77 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 12:09:40,094 INFO L168 Benchmark]: RCFGBuilder took 376.06 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:09:40,095 INFO L168 Benchmark]: TraceAbstraction took 2277.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.8 MB in the end (delta: 112.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:09:40,095 INFO L168 Benchmark]: Witness Printer took 191.21 ms. Allocated memory is still 1.2 GB. Free memory was 972.8 MB in the beginning and 967.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:09:40,097 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.06 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2277.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 972.8 MB in the end (delta: 112.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. * Witness Printer took 191.21 ms. Allocated memory is still 1.2 GB. Free memory was 972.8 MB in the beginning and 967.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={16:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={16:0}, len=0, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] EXPR inner->inner VAL [end={14:0}, inner={16:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={14:0}, inner={16:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. UNSAFE Result, 2.2s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1045 SDtfs, 1024 SDslu, 1290 SDs, 0 SdLazy, 577 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 310 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 46474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...