./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e23c3bca784f04992b2007c94519fee617936af .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-8bd4bc6 [2020-07-29 03:26:54,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:54,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:54,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:54,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:54,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:54,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:54,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:54,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:54,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:54,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:54,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:54,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:54,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:54,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:54,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:54,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:54,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:54,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:54,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:54,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:54,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:54,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:54,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:54,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:54,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:54,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:54,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:54,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:54,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:54,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:54,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:54,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:54,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:54,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:54,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:54,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:54,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:54,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:54,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:54,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:54,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:54,988 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:54,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:54,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:54,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:54,990 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:54,990 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:54,991 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:54,991 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:54,991 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:54,991 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:54,991 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:54,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:54,992 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:54,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:54,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:54,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:54,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:54,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:54,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:54,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:54,994 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:54,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:54,994 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:54,994 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:54,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:54,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:54,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:54,995 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:54,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:54,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:54,996 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:54,996 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:54,997 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:54,997 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e23c3bca784f04992b2007c94519fee617936af [2020-07-29 03:26:55,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:55,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:55,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:55,348 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:55,349 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:55,351 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2020-07-29 03:26:55,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a93439/dcbe74e8abd64d68ba5aaa9d3d20a729/FLAGa4d94ea5e [2020-07-29 03:26:55,961 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:55,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2020-07-29 03:26:55,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a93439/dcbe74e8abd64d68ba5aaa9d3d20a729/FLAGa4d94ea5e [2020-07-29 03:26:56,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a93439/dcbe74e8abd64d68ba5aaa9d3d20a729 [2020-07-29 03:26:56,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:56,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:56,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:56,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:56,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:56,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6f5296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56, skipping insertion in model container [2020-07-29 03:26:56,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:56,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:56,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:56,782 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:56,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:56,898 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:56,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56 WrapperNode [2020-07-29 03:26:56,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:56,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:56,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:56,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:56,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:56,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:56,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:56,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:56,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:56,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:57,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:57,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... [2020-07-29 03:26:57,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:57,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:57,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:57,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:57,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-07-29 03:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 03:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 03:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 03:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:57,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:57,802 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:57,802 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 03:26:57,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:57 BoogieIcfgContainer [2020-07-29 03:26:57,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:57,807 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:57,808 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:57,811 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:57,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:57,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:56" (1/3) ... [2020-07-29 03:26:57,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7691fa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:57, skipping insertion in model container [2020-07-29 03:26:57,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:57,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:56" (2/3) ... [2020-07-29 03:26:57,815 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7691fa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:57, skipping insertion in model container [2020-07-29 03:26:57,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:57,816 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:57" (3/3) ... [2020-07-29 03:26:57,818 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2020-07-29 03:26:57,872 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:57,873 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:57,873 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:57,873 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:57,873 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:57,874 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:57,874 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:57,874 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:57,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:26:57,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-07-29 03:26:57,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:57,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:57,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:57,941 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:57,941 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:57,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:26:57,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-07-29 03:26:57,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:57,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:57,949 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:57,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:26:57,959 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~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); 5#L538-2true [2020-07-29 03:26:57,959 INFO L796 eck$LassoCheckResult]: Loop: 5#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; 13#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#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; 17#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#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; 5#L538-2true [2020-07-29 03:26:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 03:26:57,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:57,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310940304] [2020-07-29 03:26:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-07-29 03:26:58,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:58,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754444501] [2020-07-29 03:26:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} 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; {27#true} is VALID [2020-07-29 03:26:58,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-29 03:26:58,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#false} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {28#false} is VALID [2020-07-29 03:26:58,205 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#false} 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; {28#false} is VALID [2020-07-29 03:26:58,205 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {28#false} is VALID [2020-07-29 03:26:58,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} 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; {28#false} is VALID [2020-07-29 03:26:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:58,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754444501] [2020-07-29 03:26:58,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:58,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:26:58,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979526457] [2020-07-29 03:26:58,216 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:26:58,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:58,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 03:26:58,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 03:26:58,235 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-29 03:26:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:58,304 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-29 03:26:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:26:58,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:26:58,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:58,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2020-07-29 03:26:58,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-07-29 03:26:58,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2020-07-29 03:26:58,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:26:58,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:26:58,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-07-29 03:26:58,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:58,337 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:26:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-07-29 03:26:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 03:26:58,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:58,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 25 transitions. Second operand 17 states. [2020-07-29 03:26:58,367 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 25 transitions. Second operand 17 states. [2020-07-29 03:26:58,369 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 17 states. [2020-07-29 03:26:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:58,372 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-07-29 03:26:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2020-07-29 03:26:58,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:58,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:58,374 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 25 transitions. [2020-07-29 03:26:58,374 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 25 transitions. [2020-07-29 03:26:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:58,376 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-07-29 03:26:58,376 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2020-07-29 03:26:58,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:58,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:58,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:58,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:26:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-07-29 03:26:58,381 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:26:58,381 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:26:58,381 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:58,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-07-29 03:26:58,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-07-29 03:26:58,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:58,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:58,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:58,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:58,384 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 62#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~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); 53#L538-2 [2020-07-29 03:26:58,384 INFO L796 eck$LassoCheckResult]: Loop: 53#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; 50#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; 51#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; 52#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 58#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#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; 61#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#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; 53#L538-2 [2020-07-29 03:26:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 03:26:58,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:58,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996023539] [2020-07-29 03:26:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:58,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:58,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:58,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-07-29 03:26:58,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:58,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420469317] [2020-07-29 03:26:58,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:58,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#true} 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; {106#true} is VALID [2020-07-29 03:26:58,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} 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; {108#(or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not |ULTIMATE.start_main_#t~short6|))} is VALID [2020-07-29 03:26:58,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {108#(or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not |ULTIMATE.start_main_#t~short6|))} 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; {109#(or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} is VALID [2020-07-29 03:26:58,637 INFO L280 TraceCheckUtils]: 3: Hoare triple {109#(or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; {109#(or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} is VALID [2020-07-29 03:26:58,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {109#(or (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))))} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {110#(or (not (= 0 |ULTIMATE.start_main_#t~mem10.base|)) (not (= |ULTIMATE.start_main_#t~mem10.offset| |ULTIMATE.start_main_#t~mem10.base|)))} is VALID [2020-07-29 03:26:58,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {110#(or (not (= 0 |ULTIMATE.start_main_#t~mem10.base|)) (not (= |ULTIMATE.start_main_#t~mem10.offset| |ULTIMATE.start_main_#t~mem10.base|)))} 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; {107#false} is VALID [2020-07-29 03:26:58,642 INFO L280 TraceCheckUtils]: 6: Hoare triple {107#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {107#false} is VALID [2020-07-29 03:26:58,642 INFO L280 TraceCheckUtils]: 7: Hoare triple {107#false} 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; {107#false} is VALID [2020-07-29 03:26:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:58,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420469317] [2020-07-29 03:26:58,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:58,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:26:58,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282942404] [2020-07-29 03:26:58,646 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:26:58,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:58,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:26:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:26:58,647 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 03:26:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:58,976 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-07-29 03:26:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:26:58,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:58,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:58,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-07-29 03:26:58,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-07-29 03:26:58,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2020-07-29 03:26:58,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 03:26:58,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 03:26:59,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2020-07-29 03:26:59,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:59,000 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-07-29 03:26:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2020-07-29 03:26:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-07-29 03:26:59,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:59,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 35 transitions. Second operand 20 states. [2020-07-29 03:26:59,005 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 35 transitions. Second operand 20 states. [2020-07-29 03:26:59,005 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 20 states. [2020-07-29 03:26:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:59,008 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-07-29 03:26:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-07-29 03:26:59,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:59,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:59,009 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 24 states and 35 transitions. [2020-07-29 03:26:59,009 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 24 states and 35 transitions. [2020-07-29 03:26:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:59,012 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-07-29 03:26:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-07-29 03:26:59,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:59,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:59,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:59,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:26:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-07-29 03:26:59,016 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 03:26:59,016 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 03:26:59,017 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:59,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-07-29 03:26:59,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:59,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:59,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:59,019 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:26:59,019 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:59,019 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 151#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~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); 141#L538-2 [2020-07-29 03:26:59,020 INFO L796 eck$LassoCheckResult]: Loop: 141#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; 137#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; 138#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; 139#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 156#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 148#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; 149#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 153#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; 141#L538-2 [2020-07-29 03:26:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-07-29 03:26:59,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:59,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814645664] [2020-07-29 03:26:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:59,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:59,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:59,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-07-29 03:26:59,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:59,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940880586] [2020-07-29 03:26:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:59,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:59,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:59,074 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-07-29 03:26:59,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:59,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310269551] [2020-07-29 03:26:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:59,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {212#true} is VALID [2020-07-29 03:26:59,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {212#true} 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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~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); {214#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)))} is VALID [2020-07-29 03:26:59,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~root~0.base) ULTIMATE.start_main_~root~0.offset)))} 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; {215#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)))} is VALID [2020-07-29 03:26:59,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {215#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)))} 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; {216#(not |ULTIMATE.start_main_#t~short6|)} is VALID [2020-07-29 03:26:59,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {216#(not |ULTIMATE.start_main_#t~short6|)} 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; {213#false} is VALID [2020-07-29 03:26:59,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {213#false} assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; {213#false} is VALID [2020-07-29 03:26:59,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {213#false} call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); {213#false} is VALID [2020-07-29 03:26:59,221 INFO L280 TraceCheckUtils]: 7: Hoare triple {213#false} 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; {213#false} is VALID [2020-07-29 03:26:59,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {213#false} call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); {213#false} is VALID [2020-07-29 03:26:59,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {213#false} 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; {213#false} is VALID [2020-07-29 03:26:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:59,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310269551] [2020-07-29 03:26:59,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:59,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:26:59,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813142128] [2020-07-29 03:26:59,411 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-07-29 03:26:59,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:59,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:26:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:26:59,505 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 03:27:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:00,021 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-07-29 03:27:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:27:00,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:27:00,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:27:00,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2020-07-29 03:27:00,043 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-07-29 03:27:00,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2020-07-29 03:27:00,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-07-29 03:27:00,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-29 03:27:00,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2020-07-29 03:27:00,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:27:00,046 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-07-29 03:27:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2020-07-29 03:27:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-07-29 03:27:00,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:27:00,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 46 transitions. Second operand 28 states. [2020-07-29 03:27:00,049 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 46 transitions. Second operand 28 states. [2020-07-29 03:27:00,049 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 28 states. [2020-07-29 03:27:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:00,052 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-07-29 03:27:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2020-07-29 03:27:00,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:00,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:00,053 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 33 states and 46 transitions. [2020-07-29 03:27:00,053 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 33 states and 46 transitions. [2020-07-29 03:27:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:27:00,056 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-07-29 03:27:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2020-07-29 03:27:00,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:27:00,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:27:00,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:27:00,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:27:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 03:27:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-29 03:27:00,060 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-29 03:27:00,060 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-29 03:27:00,060 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:27:00,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-07-29 03:27:00,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-07-29 03:27:00,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:27:00,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:27:00,062 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:27:00,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:27:00,063 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 267#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~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~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); 257#L538-2 [2020-07-29 03:27:00,063 INFO L796 eck$LassoCheckResult]: Loop: 257#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; 254#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; 255#L527-1 assume !main_#t~short6; 256#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset;havoc main_#t~short6; 281#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 280#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; 270#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 271#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; 257#L538-2 [2020-07-29 03:27:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-07-29 03:27:00,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:00,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706153405] [2020-07-29 03:27:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:00,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:00,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:00,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-07-29 03:27:00,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:00,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096625273] [2020-07-29 03:27:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:00,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:00,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:00,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:27:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-07-29 03:27:00,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:27:00,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119587068] [2020-07-29 03:27:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:27:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:00,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:27:00,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:27:00,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:27:00,264 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-07-29 03:27:00,504 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-07-29 03:27:00,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:27:00 BoogieIcfgContainer [2020-07-29 03:27:00,688 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:27:00,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:27:00,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:27:00,690 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:27:00,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:57" (3/4) ... [2020-07-29 03:27:00,700 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 03:27:00,773 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 03:27:00,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:27:00,776 INFO L168 Benchmark]: Toolchain (without parser) took 4442.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 953.5 MB in the beginning and 1.2 GB in the end (delta: -243.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:00,777 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:00,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:00,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:00,779 INFO L168 Benchmark]: Boogie Preprocessor took 41.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:00,780 INFO L168 Benchmark]: RCFGBuilder took 800.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:00,781 INFO L168 Benchmark]: BuchiAutomizer took 2881.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.1 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:27:00,782 INFO L168 Benchmark]: Witness Printer took 84.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:27:00,786 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 564.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 800.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2881.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.1 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. 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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 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=1} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ab2cd2d=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cd065bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68c17666=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c219ae9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ed16d1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b9f0b6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@560f7b39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1afe1ce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d71491c=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c82229e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ab2cd2d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40660383=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c196cea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c1ae19d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23b59b4a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1153274a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46394d77=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c196cea=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35d7531d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c1ae19d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@560f7b39=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c82229e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d71491c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c219ae9=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71dfcc5f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@68c17666=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71978622=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fc018a6=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c4f2df8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b9f0b6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46394d77=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c179008=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42783b09=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15cbf28e=17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71dfcc5f=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4791a01c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2ed16d1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1afe1ce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c4f2df8=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c179008=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4791a01c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15944d43=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7c8207e0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35d7531d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cd065bb=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71978622=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3fc018a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15944d43=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1153274a=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...