./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 356492c77ca30b45c8c64fdda8fe0cb19edee2c6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 19:30:30,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 19:30:30,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 19:30:30,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 19:30:30,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 19:30:30,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 19:30:30,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 19:30:30,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 19:30:30,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 19:30:30,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 19:30:30,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 19:30:30,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 19:30:30,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 19:30:30,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 19:30:30,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 19:30:30,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 19:30:30,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 19:30:30,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 19:30:30,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 19:30:30,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 19:30:30,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 19:30:30,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 19:30:30,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 19:30:30,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 19:30:30,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 19:30:30,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 19:30:30,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 19:30:30,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 19:30:30,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 19:30:30,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 19:30:30,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 19:30:30,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 19:30:30,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 19:30:30,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 19:30:30,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 19:30:30,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 19:30:30,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 19:30:30,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 19:30:30,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 19:30:30,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 19:30:30,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 19:30:30,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 19:30:30,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 19:30:30,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 19:30:30,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 19:30:30,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 19:30:30,476 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 19:30:30,476 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 19:30:30,476 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 19:30:30,477 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 19:30:30,477 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 19:30:30,477 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 19:30:30,478 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 19:30:30,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 19:30:30,478 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 19:30:30,478 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 19:30:30,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 19:30:30,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 19:30:30,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 19:30:30,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 19:30:30,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 19:30:30,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 19:30:30,479 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 19:30:30,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 19:30:30,480 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 19:30:30,480 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 19:30:30,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 19:30:30,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 19:30:30,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 19:30:30,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 19:30:30,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 19:30:30,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 19:30:30,482 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 19:30:30,482 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 356492c77ca30b45c8c64fdda8fe0cb19edee2c6 [2021-07-06 19:30:30,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 19:30:30,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 19:30:30,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 19:30:30,730 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 19:30:30,731 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 19:30:30,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2021-07-06 19:30:30,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7595a97a/5b437b50880e455cb2de818aa26b6078/FLAGc7c8df0c7 [2021-07-06 19:30:31,184 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 19:30:31,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2021-07-06 19:30:31,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7595a97a/5b437b50880e455cb2de818aa26b6078/FLAGc7c8df0c7 [2021-07-06 19:30:31,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7595a97a/5b437b50880e455cb2de818aa26b6078 [2021-07-06 19:30:31,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 19:30:31,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 19:30:31,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 19:30:31,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 19:30:31,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 19:30:31,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e3c2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31, skipping insertion in model container [2021-07-06 19:30:31,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 19:30:31,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 19:30:31,530 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2021-07-06 19:30:31,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:30:31,544 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 19:30:31,584 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2021-07-06 19:30:31,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 19:30:31,626 INFO L208 MainTranslator]: Completed translation [2021-07-06 19:30:31,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31 WrapperNode [2021-07-06 19:30:31,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 19:30:31,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 19:30:31,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 19:30:31,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 19:30:31,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 19:30:31,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 19:30:31,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 19:30:31,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 19:30:31,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 19:30:31,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 19:30:31,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 19:30:31,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 19:30:31,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (1/1) ... [2021-07-06 19:30:31,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 19:30:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 19:30:31,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-07-06 19:30:31,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-07-06 19:30:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-06 19:30:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-06 19:30:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-07-06 19:30:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-07-06 19:30:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 19:30:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-07-06 19:30:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-06 19:30:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 19:30:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 19:30:31,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 19:30:32,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 19:30:32,270 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-07-06 19:30:32,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:30:32 BoogieIcfgContainer [2021-07-06 19:30:32,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 19:30:32,272 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 19:30:32,272 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 19:30:32,274 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 19:30:32,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:30:32,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 07:30:31" (1/3) ... [2021-07-06 19:30:32,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60cd3881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:30:32, skipping insertion in model container [2021-07-06 19:30:32,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:30:32,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 07:30:31" (2/3) ... [2021-07-06 19:30:32,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60cd3881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 07:30:32, skipping insertion in model container [2021-07-06 19:30:32,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 19:30:32,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:30:32" (3/3) ... [2021-07-06 19:30:32,277 INFO L389 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2021-07-06 19:30:32,341 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 19:30:32,341 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 19:30:32,341 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 19:30:32,342 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 19:30:32,342 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 19:30:32,342 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 19:30:32,342 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 19:30:32,342 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 19:30:32,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:32,368 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2021-07-06 19:30:32,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:30:32,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:30:32,373 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:30:32,373 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-07-06 19:30:32,374 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 19:30:32,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:32,379 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2021-07-06 19:30:32,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:30:32,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:30:32,380 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:30:32,380 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-07-06 19:30:32,384 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 14#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, 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~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 8#L568-2true [2021-07-06 19:30:32,385 INFO L793 eck$LassoCheckResult]: Loop: 8#L568-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 30#L558-2true assume !true; 40#L557-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 17#L563true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 23#L563-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L568true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 8#L568-2true [2021-07-06 19:30:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 19:30:32,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420305717] [2021-07-06 19:30:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,466 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,496 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,513 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-07-06 19:30:32,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784805207] [2021-07-06 19:30:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:30:32,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:30:32,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:30:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:30:32,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:30:32,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784805207] [2021-07-06 19:30:32,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784805207] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:30:32,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:30:32,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 19:30:32,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222045579] [2021-07-06 19:30:32,557 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:30:32,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:30:32,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-06 19:30:32,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-06 19:30:32,575 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:30:32,583 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2021-07-06 19:30:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-06 19:30:32,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2021-07-06 19:30:32,589 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2021-07-06 19:30:32,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2021-07-06 19:30:32,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-07-06 19:30:32,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-07-06 19:30:32,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2021-07-06 19:30:32,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:30:32,594 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2021-07-06 19:30:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2021-07-06 19:30:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-07-06 19:30:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2021-07-06 19:30:32,610 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2021-07-06 19:30:32,610 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2021-07-06 19:30:32,610 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 19:30:32,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2021-07-06 19:30:32,611 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2021-07-06 19:30:32,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:30:32,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:30:32,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:30:32,615 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:30:32,616 INFO L791 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 114#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, 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~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 99#L568-2 [2021-07-06 19:30:32,616 INFO L793 eck$LassoCheckResult]: Loop: 99#L568-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 104#L558-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 101#L557-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 102#L557-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 112#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 119#L563 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 120#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 98#L568 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 99#L568-2 [2021-07-06 19:30:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 19:30:32,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519301990] [2021-07-06 19:30:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,636 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,650 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,657 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-07-06 19:30:32,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028434293] [2021-07-06 19:30:32,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:30:32,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:30:32,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 19:30:32,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-06 19:30:32,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-06 19:30:32,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:32,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:30:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:30:32,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:30:32,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028434293] [2021-07-06 19:30:32,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028434293] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:30:32,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:30:32,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 19:30:32,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058718963] [2021-07-06 19:30:32,785 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 19:30:32,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:30:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 19:30:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-06 19:30:32,786 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:30:32,916 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2021-07-06 19:30:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 19:30:32,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2021-07-06 19:30:32,918 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2021-07-06 19:30:32,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2021-07-06 19:30:32,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-07-06 19:30:32,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-07-06 19:30:32,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2021-07-06 19:30:32,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:30:32,922 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2021-07-06 19:30:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2021-07-06 19:30:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2021-07-06 19:30:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2021-07-06 19:30:32,927 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2021-07-06 19:30:32,927 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2021-07-06 19:30:32,928 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 19:30:32,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2021-07-06 19:30:32,928 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2021-07-06 19:30:32,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:30:32,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:30:32,929 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:30:32,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:30:32,929 INFO L791 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 206#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, 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~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 190#L568-2 [2021-07-06 19:30:32,929 INFO L793 eck$LassoCheckResult]: Loop: 190#L568-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 196#L558-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 192#L557-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 193#L557-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 226#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 211#L563 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 212#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 189#L568 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 190#L568-2 [2021-07-06 19:30:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 19:30:32,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23861622] [2021-07-06 19:30:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,949 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,964 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-07-06 19:30:32,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195947166] [2021-07-06 19:30:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,983 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:32,989 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:32,991 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-07-06 19:30:32,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:32,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821160505] [2021-07-06 19:30:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:32,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 19:30:33,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:30:33,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-06 19:30:33,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-06 19:30:33,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-06 19:30:33,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 19:30:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 19:30:33,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 19:30:33,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821160505] [2021-07-06 19:30:33,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821160505] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 19:30:33,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 19:30:33,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 19:30:33,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351538596] [2021-07-06 19:30:33,226 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-07-06 19:30:33,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-07-06 19:30:33,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 19:30:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 19:30:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 19:30:33,281 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 19:30:33,559 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2021-07-06 19:30:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-06 19:30:33,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2021-07-06 19:30:33,561 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2021-07-06 19:30:33,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2021-07-06 19:30:33,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2021-07-06 19:30:33,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2021-07-06 19:30:33,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2021-07-06 19:30:33,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 19:30:33,563 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2021-07-06 19:30:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2021-07-06 19:30:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2021-07-06 19:30:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 19:30:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2021-07-06 19:30:33,566 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2021-07-06 19:30:33,566 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2021-07-06 19:30:33,566 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 19:30:33,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2021-07-06 19:30:33,566 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2021-07-06 19:30:33,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 19:30:33,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 19:30:33,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 19:30:33,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 19:30:33,567 INFO L791 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 355#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, 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~mem18.base, main_#t~mem18.offset, main_#t~nondet19, 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~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.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); 336#L568-2 [2021-07-06 19:30:33,567 INFO L793 eck$LassoCheckResult]: Loop: 336#L568-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 366#L558-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 339#L557-1 assume !main_#t~short9; 340#L557-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset; 380#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 377#L563 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 378#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 335#L568 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 336#L568-2 [2021-07-06 19:30:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 19:30:33,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:33,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262757331] [2021-07-06 19:30:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:33,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:33,573 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:33,576 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:33,578 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-07-06 19:30:33,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:33,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743596082] [2021-07-06 19:30:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:33,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:33,582 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:33,585 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:33,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 19:30:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-07-06 19:30:33,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 19:30:33,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630907251] [2021-07-06 19:30:33,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 19:30:33,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 19:30:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:33,592 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 19:30:33,600 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 19:30:33,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 19:30:33,711 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2021-07-06 19:30:33,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 19:30:33,947 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2021-07-06 19:30:33,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,956 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 19:30:33,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-06 19:30:33,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 189 [2021-07-06 19:30:33,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 19:30:33,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 19:30:33,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 19:30:33,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 19:30:33,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 19:30:33,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:33,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 19:30:33,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 19:30:33,991 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-06 19:30:34,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:34,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:34,076 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 19:30:34,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:34,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 19:30:34,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2021-07-06 19:30:34,078 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-06 19:30:34,078 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2021-07-06 19:30:34,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:34,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 19:30:34,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 19:30:34,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 19:30:34,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2021-07-06 19:30:34,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 07:30:34 BoogieIcfgContainer [2021-07-06 19:30:34,198 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 19:30:34,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 19:30:34,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 19:30:34,199 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 19:30:34,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 07:30:32" (3/4) ... [2021-07-06 19:30:34,200 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 19:30:34,231 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 19:30:34,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 19:30:34,232 INFO L168 Benchmark]: Toolchain (without parser) took 3017.97 ms. Allocated memory was 54.5 MB in the beginning and 109.1 MB in the end (delta: 54.5 MB). Free memory was 29.8 MB in the beginning and 81.6 MB in the end (delta: -51.9 MB). Peak memory consumption was 975.2 kB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,232 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 34.9 MB in the beginning and 34.9 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 19:30:34,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.34 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 29.5 MB in the beginning and 41.3 MB in the end (delta: -11.8 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.32 ms. Allocated memory is still 71.3 MB. Free memory was 41.3 MB in the beginning and 39.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,233 INFO L168 Benchmark]: Boogie Preprocessor took 54.75 ms. Allocated memory is still 71.3 MB. Free memory was 38.9 MB in the beginning and 52.0 MB in the end (delta: -13.2 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,234 INFO L168 Benchmark]: RCFGBuilder took 530.15 ms. Allocated memory is still 71.3 MB. Free memory was 52.0 MB in the beginning and 35.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,234 INFO L168 Benchmark]: BuchiAutomizer took 1925.89 ms. Allocated memory was 71.3 MB in the beginning and 109.1 MB in the end (delta: 37.7 MB). Free memory was 35.6 MB in the beginning and 83.6 MB in the end (delta: -47.9 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,234 INFO L168 Benchmark]: Witness Printer took 32.78 ms. Allocated memory is still 109.1 MB. Free memory was 83.6 MB in the beginning and 81.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 19:30:34,236 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 34.9 MB in the beginning and 34.9 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 413.34 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 29.5 MB in the beginning and 41.3 MB in the end (delta: -11.8 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.32 ms. Allocated memory is still 71.3 MB. Free memory was 41.3 MB in the beginning and 39.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.75 ms. Allocated memory is still 71.3 MB. Free memory was 38.9 MB in the beginning and 52.0 MB in the end (delta: -13.2 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * RCFGBuilder took 530.15 ms. Allocated memory is still 71.3 MB. Free memory was 52.0 MB in the beginning and 35.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1925.89 ms. Allocated memory was 71.3 MB in the beginning and 109.1 MB in the end (delta: 37.7 MB). Free memory was 35.6 MB in the beginning and 83.6 MB in the end (delta: -47.9 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. * Witness Printer took 32.78 ms. Allocated memory is still 109.1 MB. Free memory was 83.6 MB in the beginning and 81.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. 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 16.2ms AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 166 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 256.6ms 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: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=24361} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dd1ae98=0, NULL=0, NULL=24363, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a60ea88=0, NULL=24361, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41cdd15f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32922e75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c8ea076=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@334ca53=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fd765f7=0, root=24360, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e70481=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24ef3497=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dd1ae98=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32922e75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f89e9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a60ea88=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b3ffa30=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2610f9a2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7758ee4a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19107efb=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cc561e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24ef3497=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f5cae10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@914ec52=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51ab0e8e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@914ec52=24360, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@334ca53=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e70481=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41cdd15f=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@498fb4e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49d580a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23a028f3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15cda21c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6db40fb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a9d02c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51ab0e8e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@356e27f=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ac765f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c8ea076=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7b206333=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b95c90f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23a028f3=0, n=24360, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b95c90f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71b78f65=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fc36e24=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68839c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@561bf836=23, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12d3a021=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@49d580a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b3ffa30=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fd765f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a9d02c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ac765f6=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7758ee4a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@10670057=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@294d87e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7b206333=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@498fb4e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7ded58a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f5cae10=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12d3a021=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@353e29de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@356e27f=0, pred=0, NULL=24362, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2610f9a2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@353e29de=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@15cda21c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 19:30:34,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...