./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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_dsw.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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:26:40,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:26:40,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:26:40,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:26:40,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:26:40,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:26:40,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:26:40,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:26:40,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:26:40,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:26:40,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:26:40,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:26:40,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:26:40,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:26:40,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:26:40,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:26:40,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:26:40,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:26:40,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:26:40,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:26:40,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:26:40,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:26:40,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:26:40,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:26:40,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:26:40,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:26:40,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:26:40,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:26:40,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:26:40,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:26:40,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:26:40,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:26:40,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:26:40,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:26:40,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:26:40,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:26:40,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:26:40,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:26:40,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:26:40,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:26:40,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:26:40,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:26:40,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:26:40,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:26:40,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:26:40,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:26:40,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:26:40,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:26:40,205 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:26:40,205 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:26:40,205 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:26:40,206 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:26:40,206 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:26:40,206 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:26:40,206 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:26:40,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:26:40,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:26:40,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:26:40,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:26:40,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:26:40,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:26:40,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:26:40,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:26:40,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:26:40,208 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:26:40,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:26:40,208 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:26:40,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:26:40,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:26:40,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:26:40,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:26:40,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:26:40,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:26:40,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:26:40,211 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:26:40,211 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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2021-12-15 17:26:40,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:26:40,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:26:40,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:26:40,462 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:26:40,462 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:26:40,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2021-12-15 17:26:40,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052d70e99/0755e1df7f9a47bc938069c87948a433/FLAG7413f1d34 [2021-12-15 17:26:40,934 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:26:40,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2021-12-15 17:26:40,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052d70e99/0755e1df7f9a47bc938069c87948a433/FLAG7413f1d34 [2021-12-15 17:26:40,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052d70e99/0755e1df7f9a47bc938069c87948a433 [2021-12-15 17:26:40,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:26:40,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:26:40,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:40,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:26:40,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:26:40,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:26:40" (1/1) ... [2021-12-15 17:26:40,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14501a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:40, skipping insertion in model container [2021-12-15 17:26:40,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:26:40" (1/1) ... [2021-12-15 17:26:40,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:26:41,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:26:41,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:41,325 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:26:41,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:41,408 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:26:41,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41 WrapperNode [2021-12-15 17:26:41,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:41,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:41,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:26:41,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:26:41,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,460 INFO L137 Inliner]: procedures = 124, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2021-12-15 17:26:41,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:41,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:26:41,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:26:41,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:26:41,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:26:41,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:26:41,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:26:41,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:26:41,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (1/1) ... [2021-12-15 17:26:41,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:41,530 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) [2021-12-15 17:26:41,537 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 [2021-12-15 17:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 17:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 17:26:41,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 17:26:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:26:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:26:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:26:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:26:41,653 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:26:41,654 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:26:41,986 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:26:41,999 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:26:42,000 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 17:26:42,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:42 BoogieIcfgContainer [2021-12-15 17:26:42,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:26:42,004 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:26:42,004 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:26:42,008 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:26:42,008 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:42,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:26:40" (1/3) ... [2021-12-15 17:26:42,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a891802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:42, skipping insertion in model container [2021-12-15 17:26:42,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:42,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:41" (2/3) ... [2021-12-15 17:26:42,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a891802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:42, skipping insertion in model container [2021-12-15 17:26:42,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:42,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:42" (3/3) ... [2021-12-15 17:26:42,012 INFO L388 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2021-12-15 17:26:42,064 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:26:42,064 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:26:42,064 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:26:42,065 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:26:42,065 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:26:42,065 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:26:42,065 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:26:42,065 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:26:42,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 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) [2021-12-15 17:26:42,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-12-15 17:26:42,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,112 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:26:42,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 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) [2021-12-15 17:26:42,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-12-15 17:26:42,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,118 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,118 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,123 INFO L791 eck$LassoCheckResult]: Stem: 15#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(11, 2); 8#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~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, 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~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~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); 21#L549-2true [2021-12-15 17:26:42,124 INFO L793 eck$LassoCheckResult]: Loop: 21#L549-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; 12#L539-2true assume !true; 18#L538-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); 7#L544true 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; 5#L544-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); 11#L549true 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; 21#L549-2true [2021-12-15 17:26:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:26:42,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732982701] [2021-12-15 17:26:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-12-15 17:26:42,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145872138] [2021-12-15 17:26:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:42,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145872138] [2021-12-15 17:26:42,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145872138] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:42,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:42,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:26:42,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907537773] [2021-12-15 17:26:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:42,402 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:42,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:42,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:26:42,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:26:42,430 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 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) [2021-12-15 17:26:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:42,436 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2021-12-15 17:26:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:26:42,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2021-12-15 17:26:42,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-12-15 17:26:42,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2021-12-15 17:26:42,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 17:26:42,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 17:26:42,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2021-12-15 17:26:42,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:42,447 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-12-15 17:26:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2021-12-15 17:26:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-15 17:26:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 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) [2021-12-15 17:26:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2021-12-15 17:26:42,465 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-12-15 17:26:42,465 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-12-15 17:26:42,465 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:26:42,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2021-12-15 17:26:42,466 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-12-15 17:26:42,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,467 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,467 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,467 INFO L791 eck$LassoCheckResult]: Stem: 64#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(11, 2); 65#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~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, 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~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~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); 70#L549-2 [2021-12-15 17:26:42,468 INFO L793 eck$LassoCheckResult]: Loop: 70#L549-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; 63#L539-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; 71#L538-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; 58#L538-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; 59#L538-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); 69#L544 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; 66#L544-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); 67#L549 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; 70#L549-2 [2021-12-15 17:26:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:26:42,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023631713] [2021-12-15 17:26:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-12-15 17:26:42,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525063485] [2021-12-15 17:26:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:42,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525063485] [2021-12-15 17:26:42,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525063485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:42,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:42,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:26:42,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350664626] [2021-12-15 17:26:42,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:42,705 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:42,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:26:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:26:42,706 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 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) [2021-12-15 17:26:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:42,826 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2021-12-15 17:26:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:26:42,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2021-12-15 17:26:42,829 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2021-12-15 17:26:42,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2021-12-15 17:26:42,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-15 17:26:42,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-15 17:26:42,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2021-12-15 17:26:42,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:42,831 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2021-12-15 17:26:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2021-12-15 17:26:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-12-15 17:26:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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) [2021-12-15 17:26:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2021-12-15 17:26:42,834 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-12-15 17:26:42,834 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-12-15 17:26:42,834 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:26:42,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2021-12-15 17:26:42,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-15 17:26:42,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,836 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,836 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,836 INFO L791 eck$LassoCheckResult]: Stem: 123#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(11, 2); 124#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~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, 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~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~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); 129#L549-2 [2021-12-15 17:26:42,837 INFO L793 eck$LassoCheckResult]: Loop: 129#L549-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; 122#L539-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; 130#L538-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; 131#L538-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; 140#L538-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); 128#L544 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; 125#L544-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); 126#L549 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; 129#L549-2 [2021-12-15 17:26:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:26:42,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670976612] [2021-12-15 17:26:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-12-15 17:26:42,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961319964] [2021-12-15 17:26:42,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,892 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-12-15 17:26:42,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900383039] [2021-12-15 17:26:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:26:42,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:42,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900383039] [2021-12-15 17:26:42,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900383039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:42,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:42,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:26:42,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318618835] [2021-12-15 17:26:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:43,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:26:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:26:43,162 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 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) [2021-12-15 17:26:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:43,332 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2021-12-15 17:26:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:26:43,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2021-12-15 17:26:43,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2021-12-15 17:26:43,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2021-12-15 17:26:43,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-12-15 17:26:43,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-12-15 17:26:43,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2021-12-15 17:26:43,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:43,335 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2021-12-15 17:26:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2021-12-15 17:26:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-12-15 17:26:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 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) [2021-12-15 17:26:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-12-15 17:26:43,339 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-12-15 17:26:43,339 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-12-15 17:26:43,339 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:26:43,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2021-12-15 17:26:43,340 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2021-12-15 17:26:43,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:43,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:43,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:43,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:43,341 INFO L791 eck$LassoCheckResult]: Stem: 201#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(11, 2); 202#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~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, 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~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~#sentinel~0#1.base, main_~#sentinel~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset, main_~succ~0#1.base, main_~succ~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~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); 208#L549-2 [2021-12-15 17:26:43,341 INFO L793 eck$LassoCheckResult]: Loop: 208#L549-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; 217#L539-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; 209#L538-1 assume !main_#t~short7#1; 210#L538-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; 226#L538-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); 224#L544 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; 203#L544-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); 204#L549 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; 208#L549-2 [2021-12-15 17:26:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:26:43,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812890516] [2021-12-15 17:26:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:43,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,358 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-12-15 17:26:43,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:43,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280929224] [2021-12-15 17:26:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:43,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,391 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-12-15 17:26:43,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:43,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523855355] [2021-12-15 17:26:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:43,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,402 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:43,412 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:43,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:26:43 BoogieIcfgContainer [2021-12-15 17:26:43,907 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:26:43,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:26:43,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:26:43,908 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:26:43,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:42" (3/4) ... [2021-12-15 17:26:43,910 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-15 17:26:43,933 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 17:26:43,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:26:43,935 INFO L158 Benchmark]: Toolchain (without parser) took 2970.75ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 66.3MB in the beginning and 57.7MB in the end (delta: 8.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,935 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:26:43,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.17ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 66.3MB in the beginning and 89.7MB in the end (delta: -23.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.98ms. Allocated memory is still 121.6MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,937 INFO L158 Benchmark]: Boogie Preprocessor took 31.93ms. Allocated memory is still 121.6MB. Free memory was 87.6MB in the beginning and 85.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,937 INFO L158 Benchmark]: RCFGBuilder took 509.77ms. Allocated memory is still 121.6MB. Free memory was 85.5MB in the beginning and 64.3MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,938 INFO L158 Benchmark]: BuchiAutomizer took 1902.96ms. Allocated memory is still 121.6MB. Free memory was 64.2MB in the beginning and 59.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,938 INFO L158 Benchmark]: Witness Printer took 26.62ms. Allocated memory is still 121.6MB. Free memory was 59.0MB in the beginning and 57.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:26:43,941 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.17ms. Allocated memory is still 96.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.17ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 66.3MB in the beginning and 89.7MB in the end (delta: -23.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.98ms. Allocated memory is still 121.6MB. Free memory was 89.7MB in the beginning and 87.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.93ms. Allocated memory is still 121.6MB. Free memory was 87.6MB in the beginning and 85.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 509.77ms. Allocated memory is still 121.6MB. Free memory was 85.5MB in the beginning and 64.3MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 1902.96ms. Allocated memory is still 121.6MB. Free memory was 64.2MB in the beginning and 59.0MB in the end (delta: 5.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Witness Printer took 26.62ms. Allocated memory is still 121.6MB. Free memory was 59.0MB in the beginning and 57.7MB in the end (delta: 1.3MB). There was no memory consumed. 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 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. 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, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 85 mSDtfsCounter, 147 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: 536]: 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@2e99995f=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@850656d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36bb14c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@334b6c19=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@459d86ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@10a855a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60a4585=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d1ec18f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@459d86ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b69cac4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@334b6c19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@681478a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a9e982=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18c7d30f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@773e40f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@656420f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@562eed6a=0, \result=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6a9e982=0, NULL=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@10a855a4=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@773e40f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b3e088e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bcd93e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2dcbebd5=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bcd93e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2da18e90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18c7d30f=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@72e8c8fc=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@11c5b320=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@cf54545=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c26fd86=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e99995f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d1ec18f=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c26fd86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60a4585=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@850656d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71a8c778=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ca7393=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@656420f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2dcbebd5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c9a3c3d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36bb14c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2da18e90=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@562eed6a=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@72e8c8fc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ca7393=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@233b649=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@681478a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@11c5b320=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@198149c3=7, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b69cac4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@640e33b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@71a8c778=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c9a3c3d=0, s=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-15 17:26:43,987 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)