./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:11:22,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:22,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:22,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:22,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:22,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:22,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:22,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:22,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:22,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:22,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:22,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:22,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:22,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:22,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:22,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:22,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:22,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:22,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:22,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:22,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:22,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:22,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:22,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:22,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:22,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:22,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:22,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:22,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:22,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:22,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:22,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:22,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:22,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:22,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:22,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:22,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:22,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:22,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:22,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:22,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:22,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 21:11:22,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:22,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:22,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:22,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:22,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:22,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:22,419 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:22,419 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 21:11:22,420 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 21:11:22,420 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 21:11:22,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 21:11:22,421 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 21:11:22,421 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 21:11:22,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:22,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:11:22,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:11:22,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:11:22,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:11:22,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:22,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 21:11:22,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 21:11:22,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 21:11:22,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:11:22,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:11:22,424 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 21:11:22,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:22,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 21:11:22,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:22,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:22,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:22,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:11:22,428 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 21:11:22,428 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2022-11-02 21:11:22,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:22,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:22,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:22,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:22,729 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:22,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-11-02 21:11:22,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/data/5b464f1f2/f073111e18ed43d4b648aed477a00ad9/FLAG38c3519ef [2022-11-02 21:11:23,299 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:23,299 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2022-11-02 21:11:23,309 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/data/5b464f1f2/f073111e18ed43d4b648aed477a00ad9/FLAG38c3519ef [2022-11-02 21:11:23,639 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/data/5b464f1f2/f073111e18ed43d4b648aed477a00ad9 [2022-11-02 21:11:23,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:23,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:23,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:23,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:23,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:23,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:23" (1/1) ... [2022-11-02 21:11:23,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9af8992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:23, skipping insertion in model container [2022-11-02 21:11:23,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:23" (1/1) ... [2022-11-02 21:11:23,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:23,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:24,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:24,010 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:24,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:24,076 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:24,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24 WrapperNode [2022-11-02 21:11:24,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:24,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:24,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:24,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:24,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,154 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-11-02 21:11:24,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:24,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:24,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:24,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:24,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,195 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:24,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:24,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:24,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:24,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (1/1) ... [2022-11-02 21:11:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 21:11:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:24,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:24,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:11:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:11:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:11:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:11:24,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:24,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:24,455 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:24,458 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:24,804 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:24,810 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:24,810 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:11:24,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:24 BoogieIcfgContainer [2022-11-02 21:11:24,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:24,813 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 21:11:24,813 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 21:11:24,820 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 21:11:24,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:11:24,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 09:11:23" (1/3) ... [2022-11-02 21:11:24,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d7287f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 09:11:24, skipping insertion in model container [2022-11-02 21:11:24,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:11:24,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:24" (2/3) ... [2022-11-02 21:11:24,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d7287f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 09:11:24, skipping insertion in model container [2022-11-02 21:11:24,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 21:11:24,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:24" (3/3) ... [2022-11-02 21:11:24,824 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2022-11-02 21:11:24,880 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 21:11:24,880 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 21:11:24,881 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 21:11:24,881 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 21:11:24,881 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 21:11:24,881 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 21:11:24,881 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 21:11:24,882 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 21:11:24,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:24,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-02 21:11:24,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:24,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:24,916 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:24,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-02 21:11:24,916 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 21:11:24,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:24,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-02 21:11:24,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:24,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:24,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:24,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-02 21:11:24,927 INFO L748 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 16#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 12#L545-2true [2022-11-02 21:11:24,928 INFO L750 eck$LassoCheckResult]: Loop: 12#L545-2true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 14#L535-2true assume !true; 17#L534-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 18#L540true assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 20#L540-2true call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 9#L545true assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 12#L545-2true [2022-11-02 21:11:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-02 21:11:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729117512] [2022-11-02 21:11:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:25,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:25,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-11-02 21:11:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446715372] [2022-11-02 21:11:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446715372] [2022-11-02 21:11:25,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446715372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:25,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:11:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052886796] [2022-11-02 21:11:25,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:25,237 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 21:11:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:11:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:11:25,279 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,290 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-11-02 21:11:25,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-11-02 21:11:25,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-02 21:11:25,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions. [2022-11-02 21:11:25,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-02 21:11:25,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-02 21:11:25,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2022-11-02 21:11:25,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:25,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-11-02 21:11:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2022-11-02 21:11:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-02 21:11:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2022-11-02 21:11:25,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-11-02 21:11:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:11:25,338 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2022-11-02 21:11:25,338 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 21:11:25,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2022-11-02 21:11:25,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-02 21:11:25,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:25,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:25,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:25,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:25,342 INFO L748 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 61#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 66#L545-2 [2022-11-02 21:11:25,343 INFO L750 eck$LassoCheckResult]: Loop: 66#L545-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 62#L535-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 56#L534-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 57#L534-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 58#L534-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 70#L540 assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; 71#L540-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 65#L545 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 66#L545-2 [2022-11-02 21:11:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-02 21:11:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188061935] [2022-11-02 21:11:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:25,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:25,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-11-02 21:11:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404381596] [2022-11-02 21:11:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404381596] [2022-11-02 21:11:25,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404381596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:25,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:25,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477969389] [2022-11-02 21:11:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:25,839 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 21:11:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:25,841 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,993 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-11-02 21:11:25,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions. [2022-11-02 21:11:25,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2022-11-02 21:11:25,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions. [2022-11-02 21:11:25,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-11-02 21:11:25,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-11-02 21:11:25,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions. [2022-11-02 21:11:25,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:25,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 41 transitions. [2022-11-02 21:11:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions. [2022-11-02 21:11:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-02 21:11:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2022-11-02 21:11:26,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-11-02 21:11:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:11:26,002 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-11-02 21:11:26,002 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 21:11:26,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2022-11-02 21:11:26,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-02 21:11:26,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:26,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:26,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:26,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:26,007 INFO L748 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 124#L545-2 [2022-11-02 21:11:26,008 INFO L750 eck$LassoCheckResult]: Loop: 124#L545-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 120#L535-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 113#L534-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 114#L534-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 135#L534-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 129#L540 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 130#L540-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 123#L545 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 124#L545-2 [2022-11-02 21:11:26,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-02 21:11:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040087557] [2022-11-02 21:11:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-11-02 21:11:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949939109] [2022-11-02 21:11:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-11-02 21:11:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774999501] [2022-11-02 21:11:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:26,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774999501] [2022-11-02 21:11:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774999501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:26,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:26,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260764132] [2022-11-02 21:11:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:26,662 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:26,896 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-11-02 21:11:26,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions. [2022-11-02 21:11:26,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2022-11-02 21:11:26,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions. [2022-11-02 21:11:26,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-11-02 21:11:26,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-11-02 21:11:26,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions. [2022-11-02 21:11:26,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:11:26,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 80 transitions. [2022-11-02 21:11:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions. [2022-11-02 21:11:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2022-11-02 21:11:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-11-02 21:11:26,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-11-02 21:11:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:26,904 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-11-02 21:11:26,904 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 21:11:26,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2022-11-02 21:11:26,905 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-11-02 21:11:26,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 21:11:26,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 21:11:26,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-02 21:11:26,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:26,906 INFO L748 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~short23#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 215#L545-2 [2022-11-02 21:11:26,906 INFO L750 eck$LassoCheckResult]: Loop: 215#L545-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 218#L535-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 204#L534-1 assume !main_#t~short7#1; 205#L534-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 234#L534-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 232#L540 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 227#L540-2 call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 214#L545 assume !((main_#t~mem16#1.base == 0 && main_#t~mem16#1.offset == 0) && 0 != main_#t~nondet17#1);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1; 215#L545-2 [2022-11-02 21:11:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-02 21:11:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205477811] [2022-11-02 21:11:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-11-02 21:11:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469509397] [2022-11-02 21:11:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-11-02 21:11:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:26,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317787447] [2022-11-02 21:11:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:26,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:11:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:27,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:11:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:11:27,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 09:11:27 BoogieIcfgContainer [2022-11-02 21:11:27,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 21:11:27,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:11:27,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:11:27,669 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:11:27,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:24" (3/4) ... [2022-11-02 21:11:27,674 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-02 21:11:27,703 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:11:27,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:11:27,704 INFO L158 Benchmark]: Toolchain (without parser) took 4059.23ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 72.5MB in the beginning and 64.6MB in the end (delta: 7.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,704 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 115.3MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:27,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.42ms. Allocated memory is still 115.3MB. Free memory was 72.4MB in the beginning and 81.7MB in the end (delta: -9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.45ms. Allocated memory is still 115.3MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,706 INFO L158 Benchmark]: Boogie Preprocessor took 54.24ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 77.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,706 INFO L158 Benchmark]: RCFGBuilder took 602.59ms. Allocated memory is still 115.3MB. Free memory was 77.5MB in the beginning and 55.6MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,707 INFO L158 Benchmark]: BuchiAutomizer took 2854.97ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 55.6MB in the beginning and 65.7MB in the end (delta: -10.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,707 INFO L158 Benchmark]: Witness Printer took 34.76ms. Allocated memory is still 138.4MB. Free memory was 65.7MB in the beginning and 64.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:11:27,709 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.28ms. Allocated memory is still 115.3MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.42ms. Allocated memory is still 115.3MB. Free memory was 72.4MB in the beginning and 81.7MB in the end (delta: -9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.45ms. Allocated memory is still 115.3MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.24ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 77.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.59ms. Allocated memory is still 115.3MB. Free memory was 77.5MB in the beginning and 55.6MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2854.97ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 55.6MB in the beginning and 65.7MB in the end (delta: -10.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 34.76ms. Allocated memory is still 138.4MB. Free memory was 65.7MB in the beginning and 64.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 80 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 532]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. 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) VAL [root={25337: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. - 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) VAL [root={25337:0}] Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] EXPR n->left [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-02 21:11:27,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5c66106-2ac4-4675-9db5-54909519f92e/bin/uautomizer-Dbtcem3rbc/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)