./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:57:23,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:57:23,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:57:23,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:57:23,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:57:23,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:57:23,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:57:23,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:57:23,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:57:23,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:57:23,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:57:23,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:57:23,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:57:23,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:57:23,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:57:23,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:57:23,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:57:23,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:57:23,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:57:23,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:57:23,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:57:23,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:57:23,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:57:23,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:57:23,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:57:23,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:57:23,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:57:23,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:57:23,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:57:23,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:57:23,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:57:23,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:57:23,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:57:23,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:57:23,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:57:23,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:57:23,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:57:23,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:57:23,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:57:23,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:57:23,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:57:23,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:57:23,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:57:23,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:57:23,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:57:23,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:57:23,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:57:23,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:57:23,112 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:57:23,113 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:57:23,113 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:57:23,113 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:57:23,113 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:57:23,114 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:57:23,114 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:57:23,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:57:23,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:57:23,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:57:23,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:57:23,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:57:23,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:57:23,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:57:23,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:57:23,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:57:23,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:57:23,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:57:23,116 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:57:23,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:57:23,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:57:23,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:57:23,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:57:23,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:57:23,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:57:23,118 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:57:23,118 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2022-02-21 03:57:23,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:57:23,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:57:23,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:57:23,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:57:23,336 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:57:23,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2022-02-21 03:57:23,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb9119b/d710b4f66530456f8dbe9e48fe65c471/FLAG27e330b97 [2022-02-21 03:57:23,784 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:57:23,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2022-02-21 03:57:23,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb9119b/d710b4f66530456f8dbe9e48fe65c471/FLAG27e330b97 [2022-02-21 03:57:24,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/accb9119b/d710b4f66530456f8dbe9e48fe65c471 [2022-02-21 03:57:24,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:57:24,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:57:24,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:24,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:57:24,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:57:24,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d3c723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24, skipping insertion in model container [2022-02-21 03:57:24,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:57:24,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:57:24,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-02-21 03:57:24,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:24,600 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:57:24,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2022-02-21 03:57:24,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:24,678 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:57:24,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24 WrapperNode [2022-02-21 03:57:24,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:24,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:24,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:57:24,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:57:24,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,733 INFO L137 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 198 [2022-02-21 03:57:24,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:24,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:57:24,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:57:24,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:57:24,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:57:24,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:57:24,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:57:24,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:57:24,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (1/1) ... [2022-02-21 03:57:24,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:24,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:24,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:57:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:57:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:57:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:57:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:57:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:57:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:57:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:57:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:57:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:57:24,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:57:24,960 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:57:24,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:57:25,709 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:57:25,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:57:25,719 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-21 03:57:25,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:25 BoogieIcfgContainer [2022-02-21 03:57:25,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:57:25,722 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:57:25,723 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:57:25,725 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:57:25,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:25,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:57:24" (1/3) ... [2022-02-21 03:57:25,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3815e633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:25, skipping insertion in model container [2022-02-21 03:57:25,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:25,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:24" (2/3) ... [2022-02-21 03:57:25,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3815e633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:25, skipping insertion in model container [2022-02-21 03:57:25,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:25,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:25" (3/3) ... [2022-02-21 03:57:25,730 INFO L388 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2022-02-21 03:57:25,772 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:57:25,772 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:57:25,773 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:57:25,773 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:57:25,773 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:57:25,773 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:57:25,773 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:57:25,773 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:57:25,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:25,823 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2022-02-21 03:57:25,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:25,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:25,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:25,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:25,829 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:57:25,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:25,843 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2022-02-21 03:57:25,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:25,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:25,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:25,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:25,850 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~nondet29#1, main_#t~malloc33#1.base, main_#t~malloc33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~nondet32#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem35#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem37#1, main_#t~mem39#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 39#L568-2true [2022-02-21 03:57:25,850 INFO L793 eck$LassoCheckResult]: Loop: 39#L568-2true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 30#L558-2true assume !true; 34#L557-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 37#L563true assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 32#L563-2true call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 44#L568true assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 39#L568-2true [2022-02-21 03:57:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:57:25,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:25,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755059849] [2022-02-21 03:57:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:25,964 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:25,989 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-02-21 03:57:25,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:25,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103506721] [2022-02-21 03:57:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:26,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {50#true} is VALID [2022-02-21 03:57:26,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#true} assume !true; {51#false} is VALID [2022-02-21 03:57:26,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); {51#false} is VALID [2022-02-21 03:57:26,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#false} assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {51#false} is VALID [2022-02-21 03:57:26,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#false} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); {51#false} is VALID [2022-02-21 03:57:26,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#false} assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; {51#false} is VALID [2022-02-21 03:57:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:26,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:26,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103506721] [2022-02-21 03:57:26,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103506721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:26,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:26,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:57:26,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785401665] [2022-02-21 03:57:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:26,053 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:57:26,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:26,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:57:26,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:57:26,075 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:26,125 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-02-21 03:57:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:57:26,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:26,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 62 transitions. [2022-02-21 03:57:26,144 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2022-02-21 03:57:26,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 55 transitions. [2022-02-21 03:57:26,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-02-21 03:57:26,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-02-21 03:57:26,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2022-02-21 03:57:26,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:26,149 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2022-02-21 03:57:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2022-02-21 03:57:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-21 03:57:26,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:26,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 55 transitions. Second operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,166 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 55 transitions. Second operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,168 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:26,170 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2022-02-21 03:57:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2022-02-21 03:57:26,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:26,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:26,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states and 55 transitions. [2022-02-21 03:57:26,173 INFO L87 Difference]: Start difference. First operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states and 55 transitions. [2022-02-21 03:57:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:26,180 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2022-02-21 03:57:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2022-02-21 03:57:26,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:26,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:26,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:26,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2022-02-21 03:57:26,186 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2022-02-21 03:57:26,186 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2022-02-21 03:57:26,186 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:57:26,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2022-02-21 03:57:26,191 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2022-02-21 03:57:26,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:26,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:26,191 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:26,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:26,192 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~nondet29#1, main_#t~malloc33#1.base, main_#t~malloc33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~nondet32#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem35#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem37#1, main_#t~mem39#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 106#L568-2 [2022-02-21 03:57:26,192 INFO L793 eck$LassoCheckResult]: Loop: 106#L568-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 128#L558-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 123#L557-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 120#L557-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 121#L557-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 131#L563 assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 129#L563-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 130#L568 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 106#L568-2 [2022-02-21 03:57:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:57:26,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:26,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404925204] [2022-02-21 03:57:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:26,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:26,247 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-02-21 03:57:26,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:26,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094551940] [2022-02-21 03:57:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:26,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {212#true} is VALID [2022-02-21 03:57:26,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {214#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not |ULTIMATE.start_main_#t~short7#1|))} is VALID [2022-02-21 03:57:26,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not |ULTIMATE.start_main_#t~short7#1|))} assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {215#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)))} is VALID [2022-02-21 03:57:26,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {215#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)))} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {215#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)))} is VALID [2022-02-21 03:57:26,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {215#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0)))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); {216#(or (not (= |ULTIMATE.start_main_#t~mem11#1.base| 0)) (not (= |ULTIMATE.start_main_#t~mem11#1.offset| 0)))} is VALID [2022-02-21 03:57:26,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {216#(or (not (= |ULTIMATE.start_main_#t~mem11#1.base| 0)) (not (= |ULTIMATE.start_main_#t~mem11#1.offset| 0)))} assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {213#false} is VALID [2022-02-21 03:57:26,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#false} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); {213#false} is VALID [2022-02-21 03:57:26,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#false} assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; {213#false} is VALID [2022-02-21 03:57:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:26,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:26,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094551940] [2022-02-21 03:57:26,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094551940] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:26,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:26,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:57:26,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799590695] [2022-02-21 03:57:26,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:26,413 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:57:26,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:26,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:26,414 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:26,605 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2022-02-21 03:57:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:26,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:26,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2022-02-21 03:57:26,615 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2022-02-21 03:57:26,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2022-02-21 03:57:26,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-02-21 03:57:26,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-02-21 03:57:26,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2022-02-21 03:57:26,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:26,617 INFO L681 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2022-02-21 03:57:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2022-02-21 03:57:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-02-21 03:57:26,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:26,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states and 65 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,620 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states and 65 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,620 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:26,624 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2022-02-21 03:57:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2022-02-21 03:57:26,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:26,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:26,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states and 65 transitions. [2022-02-21 03:57:26,625 INFO L87 Difference]: Start difference. First operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states and 65 transitions. [2022-02-21 03:57:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:26,626 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2022-02-21 03:57:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2022-02-21 03:57:26,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:26,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:26,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:26,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2022-02-21 03:57:26,628 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2022-02-21 03:57:26,628 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2022-02-21 03:57:26,628 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:57:26,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2022-02-21 03:57:26,629 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2022-02-21 03:57:26,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:26,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:26,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:26,630 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:26,630 INFO L791 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~nondet29#1, main_#t~malloc33#1.base, main_#t~malloc33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~nondet32#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem35#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem37#1, main_#t~mem39#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 273#L568-2 [2022-02-21 03:57:26,643 INFO L793 eck$LassoCheckResult]: Loop: 273#L568-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 295#L558-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 290#L557-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 291#L557-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 302#L557-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 300#L563 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 297#L563-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 298#L568 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 273#L568-2 [2022-02-21 03:57:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:57:26,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:26,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699121006] [2022-02-21 03:57:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:26,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:26,667 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-02-21 03:57:26,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:26,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007260244] [2022-02-21 03:57:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:26,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:26,691 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-02-21 03:57:26,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:26,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729573082] [2022-02-21 03:57:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:26,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:26,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); {398#true} is VALID [2022-02-21 03:57:26,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~nondet29#1, main_#t~malloc33#1.base, main_#t~malloc33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~nondet32#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem35#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem37#1, main_#t~mem39#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); {400#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-21 03:57:26,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {401#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-21 03:57:26,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {401#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {402#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-21 03:57:26,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {402#(not |ULTIMATE.start_main_#t~short7#1|)} assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {399#false} is VALID [2022-02-21 03:57:26,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#false} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {399#false} is VALID [2022-02-21 03:57:26,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); {399#false} is VALID [2022-02-21 03:57:26,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#false} assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; {399#false} is VALID [2022-02-21 03:57:26,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#false} call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); {399#false} is VALID [2022-02-21 03:57:26,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {399#false} assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; {399#false} is VALID [2022-02-21 03:57:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:26,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:26,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729573082] [2022-02-21 03:57:26,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729573082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:26,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:26,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:57:26,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2492269] [2022-02-21 03:57:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:26,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:26,947 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:27,449 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2022-02-21 03:57:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:57:27,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:27,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:27,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2022-02-21 03:57:27,461 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-02-21 03:57:27,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2022-02-21 03:57:27,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-02-21 03:57:27,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2022-02-21 03:57:27,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2022-02-21 03:57:27,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:27,466 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2022-02-21 03:57:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2022-02-21 03:57:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2022-02-21 03:57:27,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:27,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states and 137 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:27,469 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states and 137 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:27,470 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:27,473 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2022-02-21 03:57:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2022-02-21 03:57:27,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:27,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:27,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 92 states and 137 transitions. [2022-02-21 03:57:27,475 INFO L87 Difference]: Start difference. First operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 92 states and 137 transitions. [2022-02-21 03:57:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:27,478 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2022-02-21 03:57:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2022-02-21 03:57:27,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:27,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:27,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:27,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2022-02-21 03:57:27,480 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2022-02-21 03:57:27,481 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2022-02-21 03:57:27,481 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:57:27,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2022-02-21 03:57:27,481 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2022-02-21 03:57:27,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:27,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:27,482 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:27,482 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:27,482 INFO L791 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2); 508#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~nondet29#1, main_#t~malloc33#1.base, main_#t~malloc33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~nondet32#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem35#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem37#1, main_#t~mem39#1, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 509#L568-2 [2022-02-21 03:57:27,483 INFO L793 eck$LassoCheckResult]: Loop: 509#L568-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 543#L558-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 525#L557-1 assume !main_#t~short7#1; 526#L557-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 546#L557-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 545#L563 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 544#L563-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 540#L568 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 509#L568-2 [2022-02-21 03:57:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:57:27,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:27,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910439988] [2022-02-21 03:57:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:27,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:27,504 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:27,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-02-21 03:57:27,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:27,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372395394] [2022-02-21 03:57:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:27,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:27,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:27,520 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-02-21 03:57:27,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:27,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072312843] [2022-02-21 03:57:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:27,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:27,546 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:28,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:57:28 BoogieIcfgContainer [2022-02-21 03:57:28,022 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:57:28,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:57:28,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:57:28,023 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:57:28,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:25" (3/4) ... [2022-02-21 03:57:28,041 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:57:28,077 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:57:28,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:57:28,078 INFO L158 Benchmark]: Toolchain (without parser) took 3894.78ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 110.6MB in the beginning and 190.8MB in the end (delta: -80.2MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,078 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory was 120.0MB in the beginning and 120.0MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:57:28,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.92ms. Allocated memory is still 148.9MB. Free memory was 110.3MB in the beginning and 111.5MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.10ms. Allocated memory is still 148.9MB. Free memory was 111.5MB in the beginning and 109.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,079 INFO L158 Benchmark]: Boogie Preprocessor took 54.97ms. Allocated memory is still 148.9MB. Free memory was 109.0MB in the beginning and 106.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,079 INFO L158 Benchmark]: RCFGBuilder took 931.28ms. Allocated memory is still 148.9MB. Free memory was 106.1MB in the beginning and 62.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,080 INFO L158 Benchmark]: BuchiAutomizer took 2299.79ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 62.1MB in the beginning and 191.9MB in the end (delta: -129.8MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,080 INFO L158 Benchmark]: Witness Printer took 54.38ms. Allocated memory is still 232.8MB. Free memory was 191.9MB in the beginning and 190.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:57:28,082 INFO L339 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 0.17ms. Allocated memory is still 148.9MB. Free memory was 120.0MB in the beginning and 120.0MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.92ms. Allocated memory is still 148.9MB. Free memory was 110.3MB in the beginning and 111.5MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.10ms. Allocated memory is still 148.9MB. Free memory was 111.5MB in the beginning and 109.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.97ms. Allocated memory is still 148.9MB. Free memory was 109.0MB in the beginning and 106.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 931.28ms. Allocated memory is still 148.9MB. Free memory was 106.1MB in the beginning and 62.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2299.79ms. Allocated memory was 148.9MB in the beginning and 232.8MB in the end (delta: 83.9MB). Free memory was 62.1MB in the beginning and 191.9MB in the end (delta: -129.8MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 54.38ms. Allocated memory is still 232.8MB. Free memory was 191.9MB in the beginning and 190.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 345 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 166 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {a=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6320fc60=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c4b16d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a08ed3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a610806=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a610806=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@cbc463=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9e7ca9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7823c9db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64429a2b=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5db50d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4230126d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13b2e8de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5db50d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4710216a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7823c9db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e422363=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ddcc54e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1c7444e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6fa34084=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64429a2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4f34c2c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d0f146c=0, \result=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4ddcc54e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60533c8c=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e7963f9=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4230126d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3c4b16d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6fa34084=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46f26d9c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@34f8dbba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@215c7c77=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@921a8c5=0, a=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@215c7c77=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@549ff787=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1c7444e1=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3db0f9ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4de93f90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13485475=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d719c3f=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a08ed3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4de93f90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d719c3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13b2e8de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@cbc463=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6320fc60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f0774cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@731e7077=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4f34c2c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e7963f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@921a8c5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2de8d5ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9e7ca9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@549ff787=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d0f146c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@448e9ff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@dc0125c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@731e7077=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27784307=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e422363=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@28ec21f1=9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4710216a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7078b0f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f0774cb=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:57:28,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)