./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/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 66a6115d1da56800c2be9161dfbbac5b90c8a3d9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.0-a4ecdab [2020-11-28 03:00:22,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:00:22,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:00:22,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:00:22,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:00:22,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:00:22,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:00:22,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:00:22,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:00:22,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:00:22,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:00:22,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:00:22,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:00:22,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:00:22,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:00:22,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:00:22,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:00:22,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:00:22,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:00:22,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:00:22,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:00:22,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:00:22,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:00:22,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:00:22,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:00:22,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:00:22,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:00:22,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:00:22,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:00:22,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:00:22,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:00:22,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:00:22,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:00:22,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:00:22,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:00:22,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:00:22,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:00:22,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:00:22,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:00:22,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:00:22,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:00:22,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:00:23,008 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:00:23,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:00:23,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:00:23,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:00:23,010 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:00:23,010 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:00:23,010 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:00:23,011 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:00:23,011 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:00:23,011 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:00:23,011 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:00:23,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:00:23,012 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:00:23,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:00:23,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:00:23,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:00:23,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:00:23,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:00:23,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:00:23,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:00:23,013 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:00:23,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:00:23,013 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:00:23,014 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:00:23,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:00:23,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:00:23,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:00:23,014 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:00:23,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:00:23,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:00:23,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:00:23,015 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:00:23,016 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:00:23,016 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:/tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/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 -> 66a6115d1da56800c2be9161dfbbac5b90c8a3d9 [2020-11-28 03:00:23,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:00:23,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:00:23,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:00:23,272 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:00:23,273 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:00:23,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2020-11-28 03:00:23,360 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/data/ff7d633cb/bda3a139308c448db1fc812d8223e8fd/FLAGfff05720c [2020-11-28 03:00:23,903 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:00:23,904 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2020-11-28 03:00:23,918 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/data/ff7d633cb/bda3a139308c448db1fc812d8223e8fd/FLAGfff05720c [2020-11-28 03:00:24,207 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/data/ff7d633cb/bda3a139308c448db1fc812d8223e8fd [2020-11-28 03:00:24,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:00:24,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:00:24,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:00:24,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:00:24,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:00:24,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2719e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24, skipping insertion in model container [2020-11-28 03:00:24,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:00:24,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:00:24,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:00:24,710 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:00:24,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:00:24,827 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:00:24,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24 WrapperNode [2020-11-28 03:00:24,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:00:24,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:00:24,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:00:24,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:00:24,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:00:24,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:00:24,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:00:24,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:00:24,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... [2020-11-28 03:00:24,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:00:24,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:00:24,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:00:24,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:00:24,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/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 [2020-11-28 03:00:25,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-28 03:00:25,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-28 03:00:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:00:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-28 03:00:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:00:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:00:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:00:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:00:25,630 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:00:25,630 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-28 03:00:25,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:25 BoogieIcfgContainer [2020-11-28 03:00:25,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:00:25,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:00:25,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:00:25,636 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:00:25,637 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:00:25,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:00:24" (1/3) ... [2020-11-28 03:00:25,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dad6ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:25, skipping insertion in model container [2020-11-28 03:00:25,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:00:25,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:00:24" (2/3) ... [2020-11-28 03:00:25,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2dad6ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:00:25, skipping insertion in model container [2020-11-28 03:00:25,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:00:25,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:25" (3/3) ... [2020-11-28 03:00:25,640 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2020-11-28 03:00:25,679 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:00:25,679 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:00:25,679 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:00:25,679 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:00:25,679 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:00:25,679 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:00:25,679 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:00:25,680 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:00:25,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-11-28 03:00:25,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-28 03:00:25,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:00:25,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:00:25,715 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:00:25,715 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:00:25,715 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:00:25,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-11-28 03:00:25,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-28 03:00:25,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:00:25,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:00:25,719 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:00:25,719 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:00:25,726 INFO L794 eck$LassoCheckResult]: Stem: 14#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(13); 11#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 10#L545-2true [2020-11-28 03:00:25,726 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-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; 8#L535-2true assume !true; 23#L534-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 20#L540true 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; 26#L540-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 6#L545true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 10#L545-2true [2020-11-28 03:00:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 03:00:25,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:25,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006211386] [2020-11-28 03:00:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:25,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:25,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:25,933 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-11-28 03:00:25,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:25,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215237498] [2020-11-28 03:00:25,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:00:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:00:26,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215237498] [2020-11-28 03:00:26,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:00:26,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:00:26,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210517401] [2020-11-28 03:00:26,021 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:00:26,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:00:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-28 03:00:26,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-28 03:00:26,039 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-11-28 03:00:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:00:26,045 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-11-28 03:00:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:00:26,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-11-28 03:00:26,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-28 03:00:26,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2020-11-28 03:00:26,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-11-28 03:00:26,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-11-28 03:00:26,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2020-11-28 03:00:26,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:00:26,055 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-11-28 03:00:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2020-11-28 03:00:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-28 03:00:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:00:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-11-28 03:00:26,079 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-11-28 03:00:26,079 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-11-28 03:00:26,079 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:00:26,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2020-11-28 03:00:26,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-28 03:00:26,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:00:26,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:00:26,081 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:00:26,081 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:00:26,081 INFO L794 eck$LassoCheckResult]: Stem: 71#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(13); 67#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 62#L545-2 [2020-11-28 03:00:26,082 INFO L796 eck$LassoCheckResult]: Loop: 62#L545-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; 59#L535-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; 64#L534-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; 65#L534-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9; 72#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 74#L540 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; 75#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 61#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 62#L545-2 [2020-11-28 03:00:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:26,082 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-28 03:00:26,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:26,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607650873] [2020-11-28 03:00:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:26,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:26,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:26,125 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-11-28 03:00:26,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:26,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064227515] [2020-11-28 03:00:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:00:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:00:26,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064227515] [2020-11-28 03:00:26,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:00:26,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:00:26,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519940829] [2020-11-28 03:00:26,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:00:26,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:00:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:00:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:00:26,256 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-11-28 03:00:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:00:26,462 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2020-11-28 03:00:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:00:26,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2020-11-28 03:00:26,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2020-11-28 03:00:26,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2020-11-28 03:00:26,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-11-28 03:00:26,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-11-28 03:00:26,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2020-11-28 03:00:26,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:00:26,468 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-11-28 03:00:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2020-11-28 03:00:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-11-28 03:00:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-28 03:00:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-11-28 03:00:26,472 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-11-28 03:00:26,472 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-11-28 03:00:26,472 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:00:26,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-11-28 03:00:26,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-11-28 03:00:26,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:00:26,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:00:26,474 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:00:26,474 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:00:26,474 INFO L794 eck$LassoCheckResult]: Stem: 129#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(13); 125#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 119#L545-2 [2020-11-28 03:00:26,474 INFO L796 eck$LassoCheckResult]: Loop: 119#L545-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; 116#L535-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; 121#L534-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; 122#L534-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9; 134#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L540 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; 133#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 118#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 119#L545-2 [2020-11-28 03:00:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-28 03:00:26,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:26,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053396068] [2020-11-28 03:00:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:26,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:26,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:26,542 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-11-28 03:00:26,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:26,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560556622] [2020-11-28 03:00:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:26,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:26,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:26,595 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-11-28 03:00:26,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:26,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818239640] [2020-11-28 03:00:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:00:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:00:26,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818239640] [2020-11-28 03:00:26,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:00:26,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:00:26,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337965003] [2020-11-28 03:00:27,006 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-11-28 03:00:27,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:00:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:00:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:00:27,087 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-11-28 03:00:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:00:27,449 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2020-11-28 03:00:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:00:27,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2020-11-28 03:00:27,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2020-11-28 03:00:27,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2020-11-28 03:00:27,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-11-28 03:00:27,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-11-28 03:00:27,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2020-11-28 03:00:27,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:00:27,454 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2020-11-28 03:00:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2020-11-28 03:00:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2020-11-28 03:00:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-28 03:00:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-11-28 03:00:27,463 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-11-28 03:00:27,463 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-11-28 03:00:27,464 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:00:27,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2020-11-28 03:00:27,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2020-11-28 03:00:27,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:00:27,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:00:27,469 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:00:27,470 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:00:27,470 INFO L794 eck$LassoCheckResult]: Stem: 221#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(13); 217#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_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~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); 215#L545-2 [2020-11-28 03:00:27,470 INFO L796 eck$LassoCheckResult]: Loop: 215#L545-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; 212#L535-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; 213#L534-1 assume !main_#t~short9; 214#L534-3 assume !main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9; 234#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L540 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; 228#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 229#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 215#L545-2 [2020-11-28 03:00:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-28 03:00:27,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:27,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776535362] [2020-11-28 03:00:27,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:27,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:27,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:27,526 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:27,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-11-28 03:00:27,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:27,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910666037] [2020-11-28 03:00:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:27,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:27,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:27,569 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:00:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-11-28 03:00:27,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:00:27,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817122133] [2020-11-28 03:00:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:00:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:27,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:00:27,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:00:27,629 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:00:27,830 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-11-28 03:00:28,271 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-11-28 03:00:28,315 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-28 03:00:28,460 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-28 03:00:28,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:00:28,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-28 03:00:28,463 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-11-28 03:00:28,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:00:28 BoogieIcfgContainer [2020-11-28 03:00:28,595 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:00:28,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:00:28,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:00:28,596 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:00:28,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:00:25" (3/4) ... [2020-11-28 03:00:28,599 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:00:28,660 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5eeeb134-c0e0-4cc9-a513-9ed53d47c17a/bin/uautomizer/witness.graphml [2020-11-28 03:00:28,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:00:28,661 INFO L168 Benchmark]: Toolchain (without parser) took 4449.73 ms. Allocated memory was 113.2 MB in the beginning and 148.9 MB in the end (delta: 35.7 MB). Free memory was 82.0 MB in the beginning and 104.9 MB in the end (delta: -22.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,662 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 81.8 MB. Free memory is still 40.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:00:28,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.97 ms. Allocated memory is still 113.2 MB. Free memory was 82.0 MB in the beginning and 78.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.16 ms. Allocated memory is still 113.2 MB. Free memory was 78.2 MB in the beginning and 76.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,664 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 ms. Allocated memory is still 113.2 MB. Free memory was 76.1 MB in the beginning and 74.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,673 INFO L168 Benchmark]: RCFGBuilder took 674.03 ms. Allocated memory is still 113.2 MB. Free memory was 74.0 MB in the beginning and 47.6 MB in the end (delta: 26.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,674 INFO L168 Benchmark]: BuchiAutomizer took 2962.00 ms. Allocated memory was 113.2 MB in the beginning and 148.9 MB in the end (delta: 35.7 MB). Free memory was 47.6 MB in the beginning and 107.0 MB in the end (delta: -59.5 MB). Peak memory consumption was 30.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,675 INFO L168 Benchmark]: Witness Printer took 64.15 ms. Allocated memory is still 148.9 MB. Free memory was 107.0 MB in the beginning and 104.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:00:28,678 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.21 ms. Allocated memory is still 81.8 MB. Free memory is still 40.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 609.97 ms. Allocated memory is still 113.2 MB. Free memory was 82.0 MB in the beginning and 78.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.16 ms. Allocated memory is still 113.2 MB. Free memory was 78.2 MB in the beginning and 76.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.04 ms. Allocated memory is still 113.2 MB. Free memory was 76.1 MB in the beginning and 74.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 674.03 ms. Allocated memory is still 113.2 MB. Free memory was 74.0 MB in the beginning and 47.6 MB in the end (delta: 26.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2962.00 ms. Allocated memory was 113.2 MB in the beginning and 148.9 MB in the end (delta: 35.7 MB). Free memory was 47.6 MB in the beginning and 107.0 MB in the end (delta: -59.5 MB). Peak memory consumption was 30.8 MB. Max. memory is 16.1 GB. * Witness Printer took 64.15 ms. Allocated memory is still 148.9 MB. Free memory was 107.0 MB in the beginning and 104.9 MB in the end (delta: 2.1 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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 55 SDslu, 69 SDs, 0 SdLazy, 134 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 532]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7722} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f0477ff=0, NULL=0, NULL=7724, NULL=7722, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e6f21f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f6aee29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@53f44ab1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75bd1c6c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1575c959=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a70114c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2cd75e6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f0477ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3f6aee29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73c039d9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39ac1a39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d1857b7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a51ff7e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2cd75e6b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a6c8887=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bbb3c5a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47617822=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bbb3c5a=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75bd1c6c=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4a70114c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e6f21f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@646c7d3b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e800efa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24a1374b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47617822=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56c057ef=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d47240a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@53f44ab1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dee9d28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@fb89020=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@646c7d3b=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@fb89020=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cbc8d5e=25, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39ac1a39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1575c959=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24a1374b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d47240a=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@14860df7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4dee9d28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1f7b493e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@a6c8887=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56c057ef=0, pred=0, NULL=7723, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e800efa=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 532]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] EXPR n->left [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...