./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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_parent_ptr.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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:05:49,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:05:49,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:05:49,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:05:49,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:05:49,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:05:49,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:05:50,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:05:50,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:05:50,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:05:50,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:05:50,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:05:50,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:05:50,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:05:50,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:05:50,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:05:50,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:05:50,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:05:50,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:05:50,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:05:50,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:05:50,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:05:50,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:05:50,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:05:50,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:05:50,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:05:50,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:05:50,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:05:50,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:05:50,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:05:50,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:05:50,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:05:50,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:05:50,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:05:50,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:05:50,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:05:50,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:05:50,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:05:50,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:05:50,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:05:50,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:05:50,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:05:50,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:05:50,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:05:50,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:05:50,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:05:50,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:05:50,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:05:50,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:05:50,070 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:05:50,070 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:05:50,070 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:05:50,071 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:05:50,071 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:05:50,071 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:05:50,071 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:05:50,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:05:50,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:05:50,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:05:50,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:05:50,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:05:50,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:05:50,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:05:50,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:05:50,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:05:50,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:05:50,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:05:50,074 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:05:50,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:05:50,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:05:50,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:05:50,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:05:50,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:05:50,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:05:50,076 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:05:50,076 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2022-07-23 16:05:50,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:05:50,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:05:50,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:05:50,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:05:50,294 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:05:50,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-07-23 16:05:50,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759786d3d/3c18ba593b95434fbd63d519f2d6b581/FLAG83f1b28f4 [2022-07-23 16:05:50,703 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:05:50,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-07-23 16:05:50,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759786d3d/3c18ba593b95434fbd63d519f2d6b581/FLAG83f1b28f4 [2022-07-23 16:05:51,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759786d3d/3c18ba593b95434fbd63d519f2d6b581 [2022-07-23 16:05:51,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:05:51,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:05:51,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:05:51,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:05:51,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:05:51,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661be3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51, skipping insertion in model container [2022-07-23 16:05:51,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:05:51,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:05:51,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:05:51,363 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:05:51,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:05:51,408 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:05:51,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51 WrapperNode [2022-07-23 16:05:51,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:05:51,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:05:51,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:05:51,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:05:51,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,463 INFO L137 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2022-07-23 16:05:51,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:05:51,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:05:51,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:05:51,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:05:51,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:05:51,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:05:51,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:05:51,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:05:51,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (1/1) ... [2022-07-23 16:05:51,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:05:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:05:51,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:05:51,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 16:05:51,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 16:05:51,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 16:05:51,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 16:05:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 16:05:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:05:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 16:05:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:05:51,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:05:51,707 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:05:51,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:05:52,019 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:05:52,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:05:52,023 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 16:05:52,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:05:52 BoogieIcfgContainer [2022-07-23 16:05:52,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:05:52,025 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:05:52,025 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:05:52,029 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:05:52,030 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:05:52,030 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:05:51" (1/3) ... [2022-07-23 16:05:52,031 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac3d3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:05:52, skipping insertion in model container [2022-07-23 16:05:52,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:05:52,031 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:05:51" (2/3) ... [2022-07-23 16:05:52,031 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac3d3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:05:52, skipping insertion in model container [2022-07-23 16:05:52,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:05:52,032 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:05:52" (3/3) ... [2022-07-23 16:05:52,033 INFO L354 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2022-07-23 16:05:52,071 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:05:52,071 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:05:52,071 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:05:52,071 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:05:52,071 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:05:52,071 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:05:52,071 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:05:52,071 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:05:52,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) 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) [2022-07-23 16:05:52,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-23 16:05:52,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:52,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:52,088 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:52,088 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:05:52,089 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:05:52,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) 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) [2022-07-23 16:05:52,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-23 16:05:52,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:52,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:52,091 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:52,092 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:05:52,096 INFO L752 eck$LassoCheckResult]: Stem: 4#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(18, 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~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, 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_~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(12);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);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 13#L552-2true [2022-07-23 16:05:52,096 INFO L754 eck$LassoCheckResult]: Loop: 13#L552-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; 21#L541-2true assume !true; 6#L540-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); 5#L546true 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(12);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;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem16#1.base, 8 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 15#L546-2true call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 11#L552true assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 13#L552-2true [2022-07-23 16:05:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 16:05:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234870687] [2022-07-23 16:05:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-07-23 16:05:52,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388322596] [2022-07-23 16:05:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:52,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:52,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388322596] [2022-07-23 16:05:52,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388322596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:05:52,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:05:52,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 16:05:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294780373] [2022-07-23 16:05:52,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:05:52,357 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 16:05:52,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 16:05:52,378 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:52,382 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-07-23 16:05:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 16:05:52,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2022-07-23 16:05:52,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-23 16:05:52,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2022-07-23 16:05:52,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:05:52,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:05:52,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2022-07-23 16:05:52,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:52,391 INFO L369 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-23 16:05:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2022-07-23 16:05:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-23 16:05:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-07-23 16:05:52,408 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-23 16:05:52,408 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-07-23 16:05:52,408 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:05:52,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-07-23 16:05:52,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-23 16:05:52,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:52,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:52,411 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:52,411 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:05:52,411 INFO L752 eck$LassoCheckResult]: Stem: 52#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(18, 2); 53#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, 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_~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(12);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);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 61#L552-2 [2022-07-23 16:05:52,412 INFO L754 eck$LassoCheckResult]: Loop: 61#L552-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; 64#L541-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; 50#L540-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; 51#L540-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; 56#L540-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); 54#L546 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(12);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;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem16#1.base, 8 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 55#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 62#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 61#L552-2 [2022-07-23 16:05:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 16:05:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917347979] [2022-07-23 16:05:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:52,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-07-23 16:05:52,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280378129] [2022-07-23 16:05:52,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280378129] [2022-07-23 16:05:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280378129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:05:52,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:05:52,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 16:05:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064843402] [2022-07-23 16:05:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:05:52,765 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 16:05:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 16:05:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 16:05:52,766 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:52,887 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-07-23 16:05:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 16:05:52,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-07-23 16:05:52,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-07-23 16:05:52,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2022-07-23 16:05:52,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-23 16:05:52,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-23 16:05:52,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2022-07-23 16:05:52,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:52,890 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-07-23 16:05:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2022-07-23 16:05:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-07-23 16:05:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-07-23 16:05:52,892 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 16:05:52,892 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 16:05:52,892 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:05:52,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-07-23 16:05:52,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-23 16:05:52,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:52,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:52,893 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:52,894 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:05:52,894 INFO L752 eck$LassoCheckResult]: Stem: 104#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(18, 2); 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, 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_~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(12);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);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 111#L552-2 [2022-07-23 16:05:52,894 INFO L754 eck$LassoCheckResult]: Loop: 111#L552-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; 116#L541-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; 101#L540-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; 102#L540-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; 108#L540-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); 106#L546 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; 107#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 114#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 111#L552-2 [2022-07-23 16:05:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 16:05:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365012746] [2022-07-23 16:05:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-07-23 16:05:52,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854295548] [2022-07-23 16:05:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:52,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-07-23 16:05:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:52,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827152327] [2022-07-23 16:05:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:05:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:05:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:05:52,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827152327] [2022-07-23 16:05:52,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827152327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:05:52,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:05:52,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 16:05:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815944621] [2022-07-23 16:05:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:05:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:05:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 16:05:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 16:05:53,137 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:05:53,295 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-07-23 16:05:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 16:05:53,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2022-07-23 16:05:53,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-07-23 16:05:53,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2022-07-23 16:05:53,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-23 16:05:53,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-07-23 16:05:53,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2022-07-23 16:05:53,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:05:53,298 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-07-23 16:05:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2022-07-23 16:05:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-23 16:05:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:05:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-07-23 16:05:53,300 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-07-23 16:05:53,300 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-07-23 16:05:53,300 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:05:53,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2022-07-23 16:05:53,300 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-07-23 16:05:53,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:05:53,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:05:53,301 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 16:05:53,301 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:05:53,301 INFO L752 eck$LassoCheckResult]: Stem: 170#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(18, 2); 171#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, 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_~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(12);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);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 177#L552-2 [2022-07-23 16:05:53,301 INFO L754 eck$LassoCheckResult]: Loop: 177#L552-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; 184#L541-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; 168#L540-1 assume !main_#t~short7#1; 169#L540-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; 195#L540-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); 193#L546 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; 185#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 181#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 177#L552-2 [2022-07-23 16:05:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,301 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-23 16:05:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89941343] [2022-07-23 16:05:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-07-23 16:05:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607838862] [2022-07-23 16:05:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:05:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-07-23 16:05:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:05:53,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766271104] [2022-07-23 16:05:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:05:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:05:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:05:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:05:53,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:05:53,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 04:05:53 BoogieIcfgContainer [2022-07-23 16:05:53,886 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 16:05:53,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 16:05:53,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 16:05:53,887 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 16:05:53,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:05:52" (3/4) ... [2022-07-23 16:05:53,901 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-23 16:05:53,944 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 16:05:53,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 16:05:53,944 INFO L158 Benchmark]: Toolchain (without parser) took 2851.24ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 62.6MB in the beginning and 64.9MB in the end (delta: -2.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,945 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:05:53,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.83ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 64.0MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.68ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 61.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,945 INFO L158 Benchmark]: Boogie Preprocessor took 47.53ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 59.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,946 INFO L158 Benchmark]: RCFGBuilder took 512.18ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 59.9MB in the beginning and 76.6MB in the end (delta: -16.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,946 INFO L158 Benchmark]: BuchiAutomizer took 1860.95ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 76.6MB in the beginning and 67.0MB in the end (delta: 9.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,946 INFO L158 Benchmark]: Witness Printer took 57.24ms. Allocated memory is still 136.3MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 16:05:53,949 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.14ms. Allocated memory is still 94.4MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.83ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 64.0MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.68ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 61.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.53ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 59.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.18ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 59.9MB in the beginning and 76.6MB in the end (delta: -16.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 1860.95ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 76.6MB in the beginning and 67.0MB in the end (delta: 9.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Witness Printer took 57.24ms. Allocated memory is still 136.3MB. Free memory was 67.0MB in the beginning and 64.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 68 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 538]: 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@3ec94066=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7804b3b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52b02084=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37ed2e2c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74cbd2d1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5332f632=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@654f160d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5208ec3a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5332f632=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dd37719=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37ed2e2c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a67a911=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28ae025a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d69b233=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@513cc659=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33c6ea82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bec4566=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28ae025a=0, NULL=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@654f160d=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@513cc659=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64143d85=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7784f673=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@64143d85=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60fe236=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d69b233=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dd37719=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ba6dcc1=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b278b97=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@51e9f586=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fdd1d07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ec94066=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5208ec3a=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fdd1d07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7804b3b3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2dc1343e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@70288f23=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33c6ea82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7784f673=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dbfa98b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52b02084=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@60fe236=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6bec4566=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ba6dcc1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@70288f23=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@280b5763=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a67a911=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b278b97=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c5ccf09=26, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74cbd2d1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19400288=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2dc1343e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@dbfa98b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1dbf3b42=0, s=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-23 16:05:54,011 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)