./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 03:14:16,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 03:14:16,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 03:14:16,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 03:14:16,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 03:14:16,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 03:14:16,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 03:14:16,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 03:14:16,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 03:14:16,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 03:14:16,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 03:14:16,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 03:14:16,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 03:14:16,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 03:14:16,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 03:14:16,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 03:14:16,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 03:14:16,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 03:14:16,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 03:14:16,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 03:14:16,738 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 03:14:16,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 03:14:16,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 03:14:16,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 03:14:16,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 03:14:16,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 03:14:16,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 03:14:16,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 03:14:16,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 03:14:16,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 03:14:16,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 03:14:16,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 03:14:16,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 03:14:16,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 03:14:16,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 03:14:16,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 03:14:16,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 03:14:16,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 03:14:16,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 03:14:16,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 03:14:16,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 03:14:16,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 03:14:16,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 03:14:16,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 03:14:16,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 03:14:16,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 03:14:16,792 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 03:14:16,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 03:14:16,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 03:14:16,799 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 03:14:16,799 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 03:14:16,799 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 03:14:16,799 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 03:14:16,800 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 03:14:16,800 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 03:14:16,801 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 03:14:16,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 03:14:16,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 03:14:16,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 03:14:16,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 03:14:16,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 03:14:16,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 03:14:16,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 03:14:16,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 03:14:16,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 03:14:16,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 03:14:16,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 03:14:16,802 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 03:14:16,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 03:14:16,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 03:14:16,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 03:14:16,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 03:14:16,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 03:14:16,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 03:14:16,805 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 03:14:16,805 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2022-07-22 03:14:17,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 03:14:17,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 03:14:17,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 03:14:17,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 03:14:17,069 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 03:14:17,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-22 03:14:17,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e623e343b/96cb44341434427abf445cc87d400c23/FLAG50469506c [2022-07-22 03:14:17,562 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 03:14:17,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-07-22 03:14:17,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e623e343b/96cb44341434427abf445cc87d400c23/FLAG50469506c [2022-07-22 03:14:17,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e623e343b/96cb44341434427abf445cc87d400c23 [2022-07-22 03:14:17,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 03:14:17,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 03:14:17,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 03:14:17,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 03:14:17,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 03:14:17,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:14:17" (1/1) ... [2022-07-22 03:14:17,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfac3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:17, skipping insertion in model container [2022-07-22 03:14:17,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:14:17" (1/1) ... [2022-07-22 03:14:17,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 03:14:18,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 03:14:18,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:14:18,312 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 03:14:18,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:14:18,356 INFO L208 MainTranslator]: Completed translation [2022-07-22 03:14:18,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18 WrapperNode [2022-07-22 03:14:18,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 03:14:18,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 03:14:18,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 03:14:18,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 03:14:18,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,395 INFO L137 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-07-22 03:14:18,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 03:14:18,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 03:14:18,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 03:14:18,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 03:14:18,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 03:14:18,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 03:14:18,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 03:14:18,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 03:14:18,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (1/1) ... [2022-07-22 03:14:18,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:14:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:14:18,482 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-07-22 03:14:18,495 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-07-22 03:14:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 03:14:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 03:14:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 03:14:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 03:14:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 03:14:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 03:14:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 03:14:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 03:14:18,595 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 03:14:18,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 03:14:18,925 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 03:14:18,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 03:14:18,944 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 03:14:18,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:18 BoogieIcfgContainer [2022-07-22 03:14:18,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 03:14:18,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 03:14:18,947 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 03:14:18,949 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 03:14:18,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:18,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 03:14:17" (1/3) ... [2022-07-22 03:14:18,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b0bde5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:14:18, skipping insertion in model container [2022-07-22 03:14:18,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:18,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:14:18" (2/3) ... [2022-07-22 03:14:18,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b0bde5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:14:18, skipping insertion in model container [2022-07-22 03:14:18,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:14:18,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:18" (3/3) ... [2022-07-22 03:14:18,953 INFO L354 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2022-07-22 03:14:19,002 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 03:14:19,002 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 03:14:19,002 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 03:14:19,002 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 03:14:19,002 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 03:14:19,002 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 03:14:19,003 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 03:14:19,003 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 03:14:19,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-07-22 03:14:19,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:14:19,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:19,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:19,029 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:14:19,030 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 03:14:19,030 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 03:14:19,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-07-22 03:14:19,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:14:19,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:19,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:19,034 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:14:19,034 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 03:14:19,039 INFO L752 eck$LassoCheckResult]: Stem: 5#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(13, 2); 16#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_~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;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); 12#L545-2true [2022-07-22 03:14:19,040 INFO L754 eck$LassoCheckResult]: Loop: 12#L545-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; 14#L535-2true assume !true; 17#L534-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); 18#L540true 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; 20#L540-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); 9#L545true 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; 12#L545-2true [2022-07-22 03:14:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 03:14:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126368206] [2022-07-22 03:14:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-07-22 03:14:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157044137] [2022-07-22 03:14:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:19,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:19,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157044137] [2022-07-22 03:14:19,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157044137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:19,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:19,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 03:14:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265198555] [2022-07-22 03:14:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:19,296 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 03:14:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 03:14:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 03:14:19,324 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-07-22 03:14:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:19,330 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-07-22 03:14:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 03:14:19,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-07-22 03:14:19,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:14:19,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2022-07-22 03:14:19,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:14:19,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:14:19,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2022-07-22 03:14:19,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:19,342 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-07-22 03:14:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2022-07-22 03:14:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 03:14:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 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-07-22 03:14:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2022-07-22 03:14:19,362 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-07-22 03:14:19,362 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-07-22 03:14:19,362 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 03:14:19,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2022-07-22 03:14:19,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 03:14:19,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:19,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:19,365 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:14:19,365 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:19,365 INFO L752 eck$LassoCheckResult]: Stem: 60#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(13, 2); 61#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_~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;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); 66#L545-2 [2022-07-22 03:14:19,366 INFO L754 eck$LassoCheckResult]: Loop: 66#L545-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; 62#L535-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; 56#L534-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; 57#L534-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; 58#L534-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); 70#L540 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; 71#L540-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); 65#L545 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; 66#L545-2 [2022-07-22 03:14:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 03:14:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844512776] [2022-07-22 03:14:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,396 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-07-22 03:14:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574868974] [2022-07-22 03:14:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574868974] [2022-07-22 03:14:19,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574868974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:19,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:19,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 03:14:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731979612] [2022-07-22 03:14:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:19,594 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 03:14:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:19,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 03:14:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 03:14:19,595 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 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-07-22 03:14:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:19,700 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-07-22 03:14:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 03:14:19,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2022-07-22 03:14:19,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2022-07-22 03:14:19,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2022-07-22 03:14:19,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-22 03:14:19,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-22 03:14:19,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2022-07-22 03:14:19,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:19,704 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 41 transitions. [2022-07-22 03:14:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2022-07-22 03:14:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-22 03:14:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 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-07-22 03:14:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-07-22 03:14:19,706 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-07-22 03:14:19,706 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-07-22 03:14:19,706 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 03:14:19,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2022-07-22 03:14:19,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-07-22 03:14:19,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:19,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:19,707 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:14:19,707 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:19,708 INFO L752 eck$LassoCheckResult]: Stem: 118#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(13, 2); 119#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_~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;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); 124#L545-2 [2022-07-22 03:14:19,708 INFO L754 eck$LassoCheckResult]: Loop: 124#L545-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; 120#L535-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; 113#L534-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; 114#L534-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; 135#L534-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); 129#L540 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; 130#L540-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); 123#L545 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; 124#L545-2 [2022-07-22 03:14:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,708 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-22 03:14:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684735726] [2022-07-22 03:14:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-07-22 03:14:19,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484184590] [2022-07-22 03:14:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:19,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-07-22 03:14:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:19,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010711511] [2022-07-22 03:14:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:14:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:14:19,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:14:19,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010711511] [2022-07-22 03:14:19,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010711511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:14:19,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:14:19,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 03:14:19,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287808066] [2022-07-22 03:14:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:14:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:14:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 03:14:19,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 03:14:19,943 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 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-07-22 03:14:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:14:20,082 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-07-22 03:14:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:14:20,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2022-07-22 03:14:20,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2022-07-22 03:14:20,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2022-07-22 03:14:20,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 03:14:20,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 03:14:20,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2022-07-22 03:14:20,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:14:20,085 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 80 transitions. [2022-07-22 03:14:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2022-07-22 03:14:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2022-07-22 03:14:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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-07-22 03:14:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-07-22 03:14:20,087 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-07-22 03:14:20,087 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-07-22 03:14:20,087 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 03:14:20,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2022-07-22 03:14:20,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-07-22 03:14:20,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:14:20,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:14:20,088 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:14:20,088 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 03:14:20,088 INFO L752 eck$LassoCheckResult]: Stem: 208#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(13, 2); 209#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_~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;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); 215#L545-2 [2022-07-22 03:14:20,088 INFO L754 eck$LassoCheckResult]: Loop: 215#L545-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; 218#L535-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; 204#L534-1 assume !main_#t~short7#1; 205#L534-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; 234#L534-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); 232#L540 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; 227#L540-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); 214#L545 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; 215#L545-2 [2022-07-22 03:14:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-22 03:14:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:20,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869363979] [2022-07-22 03:14:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:20,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:20,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-07-22 03:14:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:20,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381500528] [2022-07-22 03:14:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:20,107 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:20,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:14:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-07-22 03:14:20,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:14:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417501728] [2022-07-22 03:14:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:14:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:14:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:20,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:14:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:14:20,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:14:20,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 03:14:20 BoogieIcfgContainer [2022-07-22 03:14:20,544 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 03:14:20,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 03:14:20,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 03:14:20,545 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 03:14:20,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:14:18" (3/4) ... [2022-07-22 03:14:20,547 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 03:14:20,566 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 03:14:20,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 03:14:20,567 INFO L158 Benchmark]: Toolchain (without parser) took 2632.32ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 46.1MB in the beginning and 50.2MB in the end (delta: -4.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-07-22 03:14:20,568 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 92.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:20,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.28ms. Allocated memory is still 67.1MB. Free memory was 45.9MB in the beginning and 42.4MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 03:14:20,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.13ms. Allocated memory is still 67.1MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 03:14:20,569 INFO L158 Benchmark]: Boogie Preprocessor took 33.07ms. Allocated memory is still 67.1MB. Free memory was 40.3MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:14:20,569 INFO L158 Benchmark]: RCFGBuilder took 514.52ms. Allocated memory is still 67.1MB. Free memory was 38.6MB in the beginning and 39.6MB in the end (delta: -962.7kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 03:14:20,570 INFO L158 Benchmark]: BuchiAutomizer took 1597.83ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 39.6MB in the beginning and 52.3MB in the end (delta: -12.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-07-22 03:14:20,570 INFO L158 Benchmark]: Witness Printer took 21.98ms. Allocated memory is still 88.1MB. Free memory was 52.3MB in the beginning and 50.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 03:14:20,572 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 92.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.28ms. Allocated memory is still 67.1MB. Free memory was 45.9MB in the beginning and 42.4MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.13ms. Allocated memory is still 67.1MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.07ms. Allocated memory is still 67.1MB. Free memory was 40.3MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 514.52ms. Allocated memory is still 67.1MB. Free memory was 38.6MB in the beginning and 39.6MB in the end (delta: -962.7kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1597.83ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 39.6MB in the beginning and 52.3MB in the end (delta: -12.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 21.98ms. Allocated memory is still 88.1MB. Free memory was 52.3MB in the beginning and 50.2MB in the end (delta: 2.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 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 80 mSDtfsCounter, 156 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 InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 532]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@320e1e65=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b299368=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ded1dd5=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78a52120=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29acc453=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43695044=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@78a52120=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35a230f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bcb1d63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17b80039=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c19d61e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48498485=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e46ddfc=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1bcb1d63=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51e1ba7d=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29acc453=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4c19d61e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18e52e05=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@67642ff4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a1b9ba5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a76d83e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a1b9ba5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33c6a480=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@17b80039=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2671d91a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@25d2f43f=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@320e1e65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@25d2f43f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43695044=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b299368=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d35fd75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6eff96a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48498485=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51e1ba7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a76d83e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ded1dd5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33c6a480=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3e46ddfc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6eff96a4=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2800762c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63cb8fa=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35a230f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aa895a8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d35fd75=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 532]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] EXPR n->left [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-22 03:14:20,631 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)