./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/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 9b66bca76c5a21a62f865fe4d9cdb8724001340a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-10-22 08:54:10,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:10,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:10,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:10,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:10,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:10,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:10,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:10,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:10,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:10,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:10,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:10,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:10,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:10,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:10,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:10,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:10,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:10,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:10,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:10,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:10,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:10,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:10,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:10,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:10,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:10,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:10,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:10,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:10,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:10,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:10,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:10,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:10,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:10,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:10,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:10,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:10,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:10,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:10,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:10,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:10,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:10,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:10,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:10,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:10,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:10,953 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:10,953 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:10,954 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:10,954 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:10,954 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:10,954 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:10,954 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:10,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:10,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:10,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:10,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:10,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:10,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:10,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:10,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:10,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:10,964 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:10,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:10,964 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:10,964 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:10,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:10,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:10,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:10,965 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:10,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:10,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:10,965 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:10,966 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:10,971 INFO L138 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_24abe443-38ad-45be-a9f3-b2542229846e/bin/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 -> 9b66bca76c5a21a62f865fe4d9cdb8724001340a [2019-10-22 08:54:11,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,015 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,017 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-10-22 08:54:11,062 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/data/67f1bf9e5/123105b49a90421bba6f91b30cbf2721/FLAG9f2f75673 [2019-10-22 08:54:11,491 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:11,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-10-22 08:54:11,501 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/data/67f1bf9e5/123105b49a90421bba6f91b30cbf2721/FLAG9f2f75673 [2019-10-22 08:54:11,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/data/67f1bf9e5/123105b49a90421bba6f91b30cbf2721 [2019-10-22 08:54:11,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:11,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:11,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:11,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:11,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:11,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:11" (1/1) ... [2019-10-22 08:54:11,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565d395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:11, skipping insertion in model container [2019-10-22 08:54:11,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:11" (1/1) ... [2019-10-22 08:54:11,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:11,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,241 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,324 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/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 [2019-10-22 08:54:12,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:54:12,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:12,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:54:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:54:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:12,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:12,831 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:12,832 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:12,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12 BoogieIcfgContainer [2019-10-22 08:54:12,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:12,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:12,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:12,837 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:12,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:11" (1/3) ... [2019-10-22 08:54:12,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b6c1b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:12,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b6c1b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:12,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/3) ... [2019-10-22 08:54:12,842 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2019-10-22 08:54:12,884 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:12,884 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:12,884 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:12,884 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:12,884 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:12,885 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:12,885 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:12,885 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:12,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-10-22 08:54:12,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-10-22 08:54:12,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,925 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:12,925 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,925 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:12,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-10-22 08:54:12,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-10-22 08:54:12,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:12,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:12,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:12,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:12,935 INFO L791 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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); 18#L538-2true [2019-10-22 08:54:12,935 INFO L793 eck$LassoCheckResult]: Loop: 18#L538-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L528-2true assume !true; 22#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L533true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 25#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L538true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 18#L538-2true [2019-10-22 08:54:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:54:12,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:12,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155939167] [2019-10-22 08:54:12,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:12,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,072 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-10-22 08:54:13,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818140986] [2019-10-22 08:54:13,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818140986] [2019-10-22 08:54:13,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:13,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734454230] [2019-10-22 08:54:13,117 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:13,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:54:13,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:54:13,133 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-22 08:54:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,140 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2019-10-22 08:54:13,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:54:13,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-10-22 08:54:13,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-10-22 08:54:13,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2019-10-22 08:54:13,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:54:13,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:54:13,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2019-10-22 08:54:13,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,149 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-10-22 08:54:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2019-10-22 08:54:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 08:54:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:54:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2019-10-22 08:54:13,176 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-10-22 08:54:13,176 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-10-22 08:54:13,176 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:13,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2019-10-22 08:54:13,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-10-22 08:54:13,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,178 INFO L791 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 75#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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#L538-2 [2019-10-22 08:54:13,178 INFO L793 eck$LassoCheckResult]: Loop: 63#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 58#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 59#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 60#L527-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6; 68#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L533 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 73#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 78#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 63#L538-2 [2019-10-22 08:54:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:54:13,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373930377] [2019-10-22 08:54:13,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,202 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-10-22 08:54:13,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172262943] [2019-10-22 08:54:13,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172262943] [2019-10-22 08:54:13,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:13,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470643796] [2019-10-22 08:54:13,284 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:13,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:13,285 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 08:54:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,422 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2019-10-22 08:54:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:13,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2019-10-22 08:54:13,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-10-22 08:54:13,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2019-10-22 08:54:13,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:54:13,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:54:13,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2019-10-22 08:54:13,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,433 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-10-22 08:54:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2019-10-22 08:54:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-10-22 08:54:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:54:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2019-10-22 08:54:13,440 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-10-22 08:54:13,440 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-10-22 08:54:13,441 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:13,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2019-10-22 08:54:13,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-10-22 08:54:13,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,442 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 135#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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#L538-2 [2019-10-22 08:54:13,442 INFO L793 eck$LassoCheckResult]: Loop: 123#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 117#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 118#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 119#L527-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6; 128#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 133#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 138#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 123#L538-2 [2019-10-22 08:54:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 08:54:13,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525028696] [2019-10-22 08:54:13,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-10-22 08:54:13,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319982673] [2019-10-22 08:54:13,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,511 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-10-22 08:54:13,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934565449] [2019-10-22 08:54:13,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:13,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934565449] [2019-10-22 08:54:13,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:13,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772674028] [2019-10-22 08:54:13,794 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-10-22 08:54:13,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:13,885 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-10-22 08:54:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,084 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-10-22 08:54:14,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:14,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2019-10-22 08:54:14,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-10-22 08:54:14,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2019-10-22 08:54:14,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-10-22 08:54:14,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 08:54:14,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2019-10-22 08:54:14,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:14,088 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-10-22 08:54:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2019-10-22 08:54:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-10-22 08:54:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:54:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-10-22 08:54:14,091 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-10-22 08:54:14,091 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-10-22 08:54:14,091 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:14,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2019-10-22 08:54:14,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-10-22 08:54:14,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:14,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:14,093 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:14,093 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:14,093 INFO L791 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 214#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.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#L538-2 [2019-10-22 08:54:14,093 INFO L793 eck$LassoCheckResult]: Loop: 215#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 195#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 196#L527-1 assume !main_#t~short6; 197#L527-3 assume !main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6; 226#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 223#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 215#L538-2 [2019-10-22 08:54:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 08:54:14,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727552386] [2019-10-22 08:54:14,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,110 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-10-22 08:54:14,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497172650] [2019-10-22 08:54:14,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,126 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-10-22 08:54:14,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799310640] [2019-10-22 08:54:14,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,296 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-22 08:54:14,499 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-22 08:54:14,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:14 BoogieIcfgContainer [2019-10-22 08:54:14,622 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:14,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:14,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:14,623 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:14,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:12" (3/4) ... [2019-10-22 08:54:14,627 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:54:14,676 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24abe443-38ad-45be-a9f3-b2542229846e/bin/uautomizer/witness.graphml [2019-10-22 08:54:14,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:14,678 INFO L168 Benchmark]: Toolchain (without parser) took 2845.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.0 MB in the beginning and 877.4 MB in the end (delta: 63.6 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:14,679 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:14,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:14,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:14,681 INFO L168 Benchmark]: Boogie Preprocessor took 27.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:14,682 INFO L168 Benchmark]: RCFGBuilder took 432.49 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: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:14,682 INFO L168 Benchmark]: BuchiAutomizer took 1788.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:14,683 INFO L168 Benchmark]: Witness Printer took 54.43 ms. Allocated memory is still 1.1 GB. Free memory was 884.3 MB in the beginning and 877.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:14,685 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 491.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 432.49 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: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1788.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 884.3 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.43 ms. Allocated memory is still 1.1 GB. Free memory was 884.3 MB in the beginning and 877.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. 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 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.2s 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: 525]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=-2} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3300d4e2=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@555a310=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@764f20be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@757acd55=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e25aec4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24692c07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@73150d79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f84a34a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3078d33c=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23d139f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3300d4e2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f25fd41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40f11d3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7081a0b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cb919be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bcc3533=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63988716=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23d139f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ed4c5ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40f11d3d=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@757acd55=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7081a0b7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@73150d79=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c229019=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3078d33c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c92a47a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e6ea781=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@764f20be=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58eabbef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e9027ea=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24692c07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a1f3179=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5c229019=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@63988716=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b2d4c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1410a39b=0, succ=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@632f36f6=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e6ea781=0, s=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@25938eeb=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e25aec4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f84a34a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fb98694=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a1f3179=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b2d4c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fb98694=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@25938eeb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@39c9010=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c92a47a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@ed4c5ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@555a310=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58eabbef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e9027ea=0, pred=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bcc3533=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 525]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) Loop: [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...