./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9237d3b61a114b84ad1dbb94dde58a712342619 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:30:29,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:30:29,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:30:29,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:30:29,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:30:29,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:30:29,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:30:29,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:30:29,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:30:29,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:30:29,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:30:29,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:30:29,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:30:29,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:30:29,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:30:29,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:30:29,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:30:29,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:30:29,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:30:29,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:30:29,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:30:29,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:30:29,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:30:29,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:30:29,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:30:29,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:30:29,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:30:29,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:30:29,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:30:29,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:30:29,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:30:29,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:30:29,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:30:29,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:30:29,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:30:29,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:30:29,144 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:30:29,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:30:29,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:30:29,156 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:30:29,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:30:29,156 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:30:29,156 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:30:29,156 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:30:29,156 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:30:29,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:30:29,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:30:29,158 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:30:29,159 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:30:29,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:30:29,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:30:29,159 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:30:29,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:30:29,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:30:29,159 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:30:29,160 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:30:29,160 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9237d3b61a114b84ad1dbb94dde58a712342619 [2018-11-22 23:30:29,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:30:29,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:30:29,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:30:29,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:30:29,195 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:30:29,196 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-11-22 23:30:29,230 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/data/8361e5231/63bac90f78ba479b91c2d9ff3bf712e7/FLAGb797a6384 [2018-11-22 23:30:29,563 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:30:29,564 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/sv-benchmarks/c/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-11-22 23:30:29,570 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/data/8361e5231/63bac90f78ba479b91c2d9ff3bf712e7/FLAGb797a6384 [2018-11-22 23:30:29,578 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/data/8361e5231/63bac90f78ba479b91c2d9ff3bf712e7 [2018-11-22 23:30:29,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:30:29,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:30:29,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:30:29,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:30:29,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:30:29,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d97fd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29, skipping insertion in model container [2018-11-22 23:30:29,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:30:29,619 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:30:29,803 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:30:29,809 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:30:29,887 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:30:29,918 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:30:29,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29 WrapperNode [2018-11-22 23:30:29,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:30:29,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:30:29,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:30:29,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:30:29,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:30:29,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:30:29,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:30:29,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:30:29,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... [2018-11-22 23:30:29,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:30:29,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:30:29,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:30:29,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:30:29,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:30:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:30:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 23:30:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 23:30:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:30:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:30:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:30:30,294 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:30:30,294 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 23:30:30,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:30:30 BoogieIcfgContainer [2018-11-22 23:30:30,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:30:30,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:30:30,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:30:30,298 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:30:30,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:30:30,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:30:29" (1/3) ... [2018-11-22 23:30:30,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9bc1d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:30:30, skipping insertion in model container [2018-11-22 23:30:30,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:30:30,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:30:29" (2/3) ... [2018-11-22 23:30:30,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9bc1d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:30:30, skipping insertion in model container [2018-11-22 23:30:30,300 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:30:30,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:30:30" (3/3) ... [2018-11-22 23:30:30,302 INFO L375 chiAutomizerObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-11-22 23:30:30,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:30:30,340 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:30:30,340 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:30:30,340 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:30:30,340 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:30:30,340 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:30:30,340 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:30:30,340 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:30:30,340 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:30:30,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-22 23:30:30,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-22 23:30:30,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:30:30,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:30:30,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:30:30,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:30:30,375 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:30:30,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-22 23:30:30,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-22 23:30:30,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:30:30,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:30:30,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:30:30,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:30:30,383 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 4#L645-2true [2018-11-22 23:30:30,384 INFO L796 eck$LassoCheckResult]: Loop: 4#L645-2true assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 16#L635-2true assume !true; 8#L634-5true call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 20#L640true assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 11#L640-2true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 15#L645true assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 4#L645-2true [2018-11-22 23:30:30,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 23:30:30,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2018-11-22 23:30:30,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:30:30,499 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-22 23:30:30,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:30:30,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:30:30,503 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:30:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 23:30:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 23:30:30,513 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-22 23:30:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:30:30,518 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2018-11-22 23:30:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 23:30:30,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2018-11-22 23:30:30,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-22 23:30:30,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2018-11-22 23:30:30,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-22 23:30:30,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-22 23:30:30,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2018-11-22 23:30:30,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:30:30,526 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2018-11-22 23:30:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2018-11-22 23:30:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-22 23:30:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:30:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-11-22 23:30:30,550 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2018-11-22 23:30:30,550 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2018-11-22 23:30:30,550 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:30:30,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2018-11-22 23:30:30,551 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-22 23:30:30,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:30:30,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:30:30,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:30:30,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:30:30,552 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 75#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 63#L645-2 [2018-11-22 23:30:30,552 INFO L796 eck$LassoCheckResult]: Loop: 63#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 58#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 59#L634-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 60#L634-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; 68#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L640 assume (main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc10.base, main_#t~malloc10.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem11.base, main_#t~mem11.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11.base, main_#t~mem11.offset, 4);havoc main_#t~mem11.base, main_#t~mem11.offset;call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem12.base, 4 + main_#t~mem12.offset, 4);havoc main_#t~mem12.base, main_#t~mem12.offset; 73#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 77#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 63#L645-2 [2018-11-22 23:30:30,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-22 23:30:30,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2018-11-22 23:30:30,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:30:30,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:30:30,659 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-22 23:30:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:30:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:30:30,660 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:30:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:30:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:30:30,661 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-22 23:30:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:30:30,798 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2018-11-22 23:30:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:30:30,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2018-11-22 23:30:30,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-22 23:30:30,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2018-11-22 23:30:30,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-22 23:30:30,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 23:30:30,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2018-11-22 23:30:30,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:30:30,803 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-22 23:30:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2018-11-22 23:30:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-22 23:30:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 23:30:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2018-11-22 23:30:30,806 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2018-11-22 23:30:30,806 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2018-11-22 23:30:30,806 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:30:30,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2018-11-22 23:30:30,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2018-11-22 23:30:30,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:30:30,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:30:30,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:30:30,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:30:30,807 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 135#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 123#L645-2 [2018-11-22 23:30:30,807 INFO L796 eck$LassoCheckResult]: Loop: 123#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 117#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 118#L634-1 assume main_#t~short4;call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short4 := main_#t~mem3.base != 0 || main_#t~mem3.offset != 0; 119#L634-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; 128#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L640 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 133#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 137#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 123#L645-2 [2018-11-22 23:30:30,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-22 23:30:30,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2018-11-22 23:30:30,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:30:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:30,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2018-11-22 23:30:30,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:30:30,923 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-22 23:30:30,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:30:30,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:30:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:30:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:30:31,068 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-22 23:30:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:30:31,194 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-11-22 23:30:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:30:31,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2018-11-22 23:30:31,196 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2018-11-22 23:30:31,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2018-11-22 23:30:31,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-22 23:30:31,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-22 23:30:31,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2018-11-22 23:30:31,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:30:31,198 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-11-22 23:30:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2018-11-22 23:30:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-11-22 23:30:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 23:30:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-11-22 23:30:31,200 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-11-22 23:30:31,200 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-11-22 23:30:31,201 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:30:31,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2018-11-22 23:30:31,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2018-11-22 23:30:31,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:30:31,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:30:31,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:30:31,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:30:31,202 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 214#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L645-2 [2018-11-22 23:30:31,202 INFO L796 eck$LassoCheckResult]: Loop: 215#L645-2 assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 195#L635-2 call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; 196#L634-1 assume !main_#t~short4; 197#L634-3 assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; 226#L634-5 call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L640 assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; 223#L640-2 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L645 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 215#L645-2 [2018-11-22 23:30:31,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-22 23:30:31,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:31,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:31,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:31,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:31,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:31,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2018-11-22 23:30:31,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:31,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:31,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:31,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:30:31,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:31,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:30:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2018-11-22 23:30:31,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:30:31,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:30:31,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:31,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:30:31,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:30:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:30:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-22 23:30:31,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:30:31 BoogieIcfgContainer [2018-11-22 23:30:31,501 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:30:31,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:30:31,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:30:31,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:30:31,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:30:30" (3/4) ... [2018-11-22 23:30:31,505 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- [2018-11-22 23:30:31,542 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ffaf8259-3911-43a6-b705-5b327fe11c37/bin-2019/uautomizer/witness.graphml [2018-11-22 23:30:31,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:30:31,543 INFO L168 Benchmark]: Toolchain (without parser) took 1962.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.6 MB in the beginning and 893.3 MB in the end (delta: 63.3 MB). Peak memory consumption was 180.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,544 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:30:31,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,545 INFO L168 Benchmark]: Boogie Preprocessor took 25.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,546 INFO L168 Benchmark]: RCFGBuilder took 316.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,546 INFO L168 Benchmark]: BuchiAutomizer took 1206.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 896.0 MB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,547 INFO L168 Benchmark]: Witness Printer took 40.62 ms. Allocated memory is still 1.1 GB. Free memory was 896.0 MB in the beginning and 893.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:30:31,550 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 316.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1206.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 896.0 MB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. * Witness Printer took 40.62 ms. Allocated memory is still 1.1 GB. Free memory was 896.0 MB in the beginning and 893.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 632]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2422c3fd=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5507b98f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d4103a8=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8802350=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31c04ee6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@95ce16b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6896b397=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50ffdb25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15aa56de=0, root=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3bc6d4e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2422c3fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7260f826=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@77d4d28a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62d0036e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ad217d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6896b397=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3bc6d4e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15aa56de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8802350=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39d5d6d8=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c62be08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1436e49=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62d0036e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e2dd4f1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2365c04=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2365c04=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3ca81664=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@95ce16b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@41f860d1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d0c7c65=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a50ee85=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39d5d6d8=0, n=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d0c7c65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33584659=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31c04ee6=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7260f826=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@428bccc=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a09363f=17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@50ffdb25=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1436e49=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3ca81664=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@41f860d1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@37016bb2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@428bccc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@255ecf41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53b18624=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d4103a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ad217d4=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e2dd4f1=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53b18624=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@255ecf41=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c62be08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5507b98f=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 632]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~nondet5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem2.base, main_#t~mem2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~short4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~nondet1, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset; [L629] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L629] main_~root~0.base, main_~root~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L629] havoc main_~n~0.base, main_~n~0.offset; [L630] call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4); [L631] call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem2, main_#t~mem3, main_#t~short4, main_#t~mem8, main_#t~nondet9, main_#t~malloc10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~nondet1, main_#t~mem18, main_#t~mem19, main_#t~malloc20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~malloc24, main_#t~mem25, main_#t~mem26, main_#t~malloc27, main_#t~mem28, main_~root~0, main_~n~0, main_~#sentinel~0, main_~pred~0, main_~succ~0, main_~s~0, main_~st~0; [L629] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L629] main_~root~0 := main_#t~malloc0; [L629] havoc main_~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: main_~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~root~0!base, offset: 4 + main_~root~0!offset }, 4); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L629] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L629] ~root~0 := #t~malloc0; [L629] havoc ~n~0; [L630] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: ~root~0!offset }, 4); [L631] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~root~0!base, offset: 4 + ~root~0!offset }, 4); [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(0 != main_#t~nondet1);havoc main_#t~nondet1;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [?] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [?] assume !main_#t~short4; [?] assume !main_#t~short4;havoc main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem2.base, main_#t~mem2.offset;havoc main_#t~short4; [?] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [?] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9);havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~nondet9; [?] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [?] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L632-L650] assume !!(0 != main_#t~nondet1); [L632] havoc main_#t~nondet1; [L633] main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; [L634] call main_#t~mem2.base, main_#t~mem2.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L634] main_#t~short4 := main_#t~mem2.base != 0 || main_#t~mem2.offset != 0; [L634] assume !main_#t~short4; [L634-L639] assume !main_#t~short4; [L634] havoc main_#t~mem3.base, main_#t~mem3.offset; [L634] havoc main_#t~mem2.base, main_#t~mem2.offset; [L634] havoc main_#t~short4; [L640] call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); [L640-L644] assume !((main_#t~mem8.base == 0 && main_#t~mem8.offset == 0) && 0 != main_#t~nondet9); [L640] havoc main_#t~mem8.base, main_#t~mem8.offset; [L640] havoc main_#t~nondet9; [L645] call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); [L645-L649] assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14); [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13.base, main_#t~mem13.offset; [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L632-L650] COND FALSE !(!(0 != main_#t~nondet1)) [L632] havoc main_#t~nondet1; [L633] main_~n~0 := main_~root~0; [L634] FCALL call main_#t~mem2 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L634] main_#t~short4 := main_#t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(main_#t~short4) [L634-L639] COND TRUE !main_#t~short4 [L634] havoc main_#t~mem3; [L634] havoc main_#t~mem2; [L634] havoc main_#t~short4; [L640] FCALL call main_#t~mem8 := read~$Pointer$({ base: main_~n~0!base, offset: main_~n~0!offset }, 4); [L640] COND FALSE !(main_#t~mem8 == { base: 0, offset: 0 } && 0 != main_#t~nondet9) [L640] havoc main_#t~mem8; [L640] havoc main_#t~nondet9; [L645] FCALL call main_#t~mem13 := read~$Pointer$({ base: main_~n~0!base, offset: 4 + main_~n~0!offset }, 4); [L645] COND FALSE !(main_#t~mem13 == { base: 0, offset: 0 } && 0 != main_#t~nondet14) [L645] havoc main_#t~nondet14; [L645] havoc main_#t~mem13; [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L632-L650] COND FALSE !(!(0 != #t~nondet1)) [L632] havoc #t~nondet1; [L633] ~n~0 := ~root~0; [L634] FCALL call #t~mem2 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L634] #t~short4 := #t~mem2 != { base: 0, offset: 0 }; [L634] COND FALSE !(#t~short4) [L634-L639] COND TRUE !#t~short4 [L634] havoc #t~mem3; [L634] havoc #t~mem2; [L634] havoc #t~short4; [L640] FCALL call #t~mem8 := read~$Pointer$({ base: ~n~0!base, offset: ~n~0!offset }, 4); [L640] COND FALSE !(#t~mem8 == { base: 0, offset: 0 } && 0 != #t~nondet9) [L640] havoc #t~mem8; [L640] havoc #t~nondet9; [L645] FCALL call #t~mem13 := read~$Pointer$({ base: ~n~0!base, offset: 4 + ~n~0!offset }, 4); [L645] COND FALSE !(#t~mem13 == { base: 0, offset: 0 } && 0 != #t~nondet14) [L645] havoc #t~nondet14; [L645] havoc #t~mem13; [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; [L630] root->left = ((void *)0) [L631] root->right = ((void *)0) Loop: [L632] COND TRUE __VERIFIER_nondet_int() [L633] n = root [L634] EXPR n->left [L634] n->left && n->right [L634] COND FALSE !(n->left && n->right) [L640] EXPR n->left [L640] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L645] EXPR n->right [L645] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...