./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 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_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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:26:39,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:26:39,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:26:39,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:26:39,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:26:39,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:26:39,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:26:39,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:26:39,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:26:39,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:26:39,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:26:39,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:26:39,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:26:39,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:26:39,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:26:39,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:26:39,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:26:39,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:26:39,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:26:39,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:26:39,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:26:39,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:26:39,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:26:39,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:26:39,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:26:39,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:26:39,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:26:39,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:26:39,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:26:39,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:26:39,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:26:39,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:26:39,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:26:39,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:26:39,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:26:39,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:26:39,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:26:39,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:26:39,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:26:39,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:26:39,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:26:39,191 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:39,218 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:26:39,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:26:39,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:26:39,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:26:39,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:26:39,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:26:39,221 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:26:39,221 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:26:39,221 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:26:39,221 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:26:39,222 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:26:39,222 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:26:39,222 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:26:39,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:26:39,223 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:26:39,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:26:39,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:26:39,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:26:39,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:26:39,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:26:39,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:26:39,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:26:39,225 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:26:39,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:26:39,226 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:26:39,226 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:26:39,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:26:39,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:26:39,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:26:39,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:26:39,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:26:39,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:26:39,228 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:26:39,228 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 [2021-12-15 17:26:39,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:26:39,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:26:39,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:26:39,490 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:26:39,491 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:26:39,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2021-12-15 17:26:39,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abebe4b5d/6a41da737cd446e8aa284ebae637dd0f/FLAG484a822a3 [2021-12-15 17:26:40,001 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:26:40,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2021-12-15 17:26:40,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abebe4b5d/6a41da737cd446e8aa284ebae637dd0f/FLAG484a822a3 [2021-12-15 17:26:40,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abebe4b5d/6a41da737cd446e8aa284ebae637dd0f [2021-12-15 17:26:40,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:26:40,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:26:40,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:40,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:26:40,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:26:40,052 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,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d184215 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,053 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,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:26:40,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:26:40,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:40,412 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:26:40,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:26:40,467 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:26:40,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:40 WrapperNode [2021-12-15 17:26:40,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:26:40,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:40,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:26:40,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:26:40,475 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:40" (1/1) ... [2021-12-15 17:26:40,486 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:40" (1/1) ... [2021-12-15 17:26:40,519 INFO L137 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-12-15 17:26:40,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:26:40,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:26:40,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:26:40,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:26:40,527 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:40" (1/1) ... [2021-12-15 17:26:40,528 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:40" (1/1) ... [2021-12-15 17:26:40,546 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:40" (1/1) ... [2021-12-15 17:26:40,548 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:40" (1/1) ... [2021-12-15 17:26:40,560 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:40" (1/1) ... [2021-12-15 17:26:40,569 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:40" (1/1) ... [2021-12-15 17:26:40,571 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:40" (1/1) ... [2021-12-15 17:26:40,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:26:40,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:26:40,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:26:40,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:26:40,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:40" (1/1) ... [2021-12-15 17:26:40,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:26:40,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:26:40,639 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:40,647 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:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 17:26:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:26:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 17:26:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 17:26:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:26:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:26:40,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:26:40,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:26:40,768 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:26:40,780 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:26:41,122 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:26:41,127 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:26:41,127 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 17:26:41,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:41 BoogieIcfgContainer [2021-12-15 17:26:41,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:26:41,130 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:26:41,130 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:26:41,137 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:26:41,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:41,139 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:41,140 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7c1225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:41, skipping insertion in model container [2021-12-15 17:26:41,140 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:41,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:26:40" (2/3) ... [2021-12-15 17:26:41,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7c1225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:26:41, skipping insertion in model container [2021-12-15 17:26:41,141 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:26:41,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:26:41" (3/3) ... [2021-12-15 17:26:41,142 INFO L388 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2021-12-15 17:26:41,188 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:26:41,188 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:26:41,188 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:26:41,188 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:26:41,188 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:26:41,188 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:26:41,189 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:26:41,189 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:26:41,203 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) [2021-12-15 17:26:41,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-15 17:26:41,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,223 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,224 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:26:41,224 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:26:41,224 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) [2021-12-15 17:26:41,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-15 17:26:41,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,229 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,229 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:26:41,234 INFO L791 eck$LassoCheckResult]: Stem: 6#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); 17#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); 13#L545-2true [2021-12-15 17:26:41,235 INFO L793 eck$LassoCheckResult]: Loop: 13#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; 15#L535-2true assume !true; 18#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); 19#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; 21#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); 10#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; 13#L545-2true [2021-12-15 17:26:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:26:41,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009851152] [2021-12-15 17:26:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,330 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-12-15 17:26:41,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111504298] [2021-12-15 17:26:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:41,462 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:41,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:41,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111504298] [2021-12-15 17:26:41,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111504298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:41,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:41,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:26:41,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670421772] [2021-12-15 17:26:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:41,468 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:41,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:26:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:26:41,499 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) [2021-12-15 17:26:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:41,506 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-12-15 17:26:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:26:41,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-12-15 17:26:41,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-15 17:26:41,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2021-12-15 17:26:41,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-15 17:26:41,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-15 17:26:41,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2021-12-15 17:26:41,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:41,519 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2021-12-15 17:26:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2021-12-15 17:26:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-15 17:26:41,539 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) [2021-12-15 17:26:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2021-12-15 17:26:41,541 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2021-12-15 17:26:41,541 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2021-12-15 17:26:41,541 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:26:41,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2021-12-15 17:26:41,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-12-15 17:26:41,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,543 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,544 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:41,544 INFO L791 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 [2021-12-15 17:26:41,545 INFO L793 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 [2021-12-15 17:26:41,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:26:41,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620600916] [2021-12-15 17:26:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-12-15 17:26:41,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500584261] [2021-12-15 17:26:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:41,820 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:41,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:41,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500584261] [2021-12-15 17:26:41,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500584261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:41,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:41,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:26:41,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326079013] [2021-12-15 17:26:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:41,823 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:26:41,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:41,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:26:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:26:41,825 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) [2021-12-15 17:26:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:41,938 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2021-12-15 17:26:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:26:41,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2021-12-15 17:26:41,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-15 17:26:41,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2021-12-15 17:26:41,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-15 17:26:41,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-15 17:26:41,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2021-12-15 17:26:41,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:41,943 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2021-12-15 17:26:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2021-12-15 17:26:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-12-15 17:26:41,946 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) [2021-12-15 17:26:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2021-12-15 17:26:41,946 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2021-12-15 17:26:41,946 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2021-12-15 17:26:41,947 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:26:41,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2021-12-15 17:26:41,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-12-15 17:26:41,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:41,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:41,950 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:41,950 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:41,950 INFO L791 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 [2021-12-15 17:26:41,950 INFO L793 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 [2021-12-15 17:26:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:26:41,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416787965] [2021-12-15 17:26:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-12-15 17:26:41,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860895047] [2021-12-15 17:26:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:41,987 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-12-15 17:26:41,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:41,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570316508] [2021-12-15 17:26:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:41,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:26:42,038 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,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:26:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570316508] [2021-12-15 17:26:42,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570316508] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:26:42,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:26:42,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:26:42,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261605271] [2021-12-15 17:26:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:26:42,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:26:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:26:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:26:42,245 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) [2021-12-15 17:26:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:26:42,402 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2021-12-15 17:26:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:26:42,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2021-12-15 17:26:42,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2021-12-15 17:26:42,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2021-12-15 17:26:42,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-15 17:26:42,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-15 17:26:42,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2021-12-15 17:26:42,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:26:42,406 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 80 transitions. [2021-12-15 17:26:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2021-12-15 17:26:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2021-12-15 17:26:42,408 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) [2021-12-15 17:26:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2021-12-15 17:26:42,409 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-12-15 17:26:42,409 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2021-12-15 17:26:42,409 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:26:42,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2021-12-15 17:26:42,410 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2021-12-15 17:26:42,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:26:42,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:26:42,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:26:42,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:26:42,410 INFO L791 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 [2021-12-15 17:26:42,411 INFO L793 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 [2021-12-15 17:26:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:26:42,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507983131] [2021-12-15 17:26:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,425 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-12-15 17:26:42,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182780379] [2021-12-15 17:26:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,458 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:26:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-12-15 17:26:42,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:26:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836599009] [2021-12-15 17:26:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:26:42,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:26:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:26:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:26:42,499 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:26:42,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:26:42 BoogieIcfgContainer [2021-12-15 17:26:42,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:26:42,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:26:42,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:26:42,993 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:26:42,994 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:41" (3/4) ... [2021-12-15 17:26:42,995 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-15 17:26:43,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 17:26:43,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:26:43,036 INFO L158 Benchmark]: Toolchain (without parser) took 2989.13ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 67.0MB in the beginning and 56.2MB in the end (delta: 10.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,037 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:26:43,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.74ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 67.0MB in the beginning and 87.9MB in the end (delta: -20.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.63ms. Allocated memory is still 119.5MB. Free memory was 87.9MB in the beginning and 85.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,038 INFO L158 Benchmark]: Boogie Preprocessor took 57.20ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,039 INFO L158 Benchmark]: RCFGBuilder took 551.01ms. Allocated memory is still 119.5MB. Free memory was 84.2MB in the beginning and 65.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,039 INFO L158 Benchmark]: BuchiAutomizer took 1863.05ms. Allocated memory is still 119.5MB. Free memory was 65.3MB in the beginning and 58.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,040 INFO L158 Benchmark]: Witness Printer took 42.48ms. Allocated memory is still 119.5MB. Free memory was 58.2MB in the beginning and 56.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:26:43,042 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.19ms. Allocated memory is still 98.6MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.74ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 67.0MB in the beginning and 87.9MB in the end (delta: -20.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.63ms. Allocated memory is still 119.5MB. Free memory was 87.9MB in the beginning and 85.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.20ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.01ms. Allocated memory is still 119.5MB. Free memory was 84.2MB in the beginning and 65.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1863.05ms. Allocated memory is still 119.5MB. Free memory was 65.3MB in the beginning and 58.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 42.48ms. Allocated memory is still 119.5MB. Free memory was 58.2MB in the beginning and 56.2MB in the end (delta: 2.0MB). 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.7s 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, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 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 - 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@1a7bbcc8=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@367cf918=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cfb25dd=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32555d62=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69d2a9a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@297ed71a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32555d62=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a49ac55=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35605e74=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74498956=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@12c10765=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33cf85e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@387c9a87=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35605e74=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e964bb9=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@69d2a9a6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@12c10765=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@758af316=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@70aaeffb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@292c33ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a5c45e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@292c33ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34cccce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74498956=0, n=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7b7b4818=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f634048=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a7bbcc8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f634048=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@297ed71a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@367cf918=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67275a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@574e2ec2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33cf85e9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e964bb9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a5c45e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cfb25dd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34cccce3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@387c9a87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@574e2ec2=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d8b452c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5345636a=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a49ac55=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58d52882=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@67275a5=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! [2021-12-15 17:26:43,087 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)