./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:13:49,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:13:49,622 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:13:49,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:13:49,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:13:49,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:13:49,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:13:49,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:13:49,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:13:49,659 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:13:49,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:13:49,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:13:49,661 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:13:49,661 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:13:49,662 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:13:49,663 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:13:49,663 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:13:49,664 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:13:49,664 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:13:49,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:13:49,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:13:49,666 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:13:49,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:13:49,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:13:49,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:13:49,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:13:49,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:13:49,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:13:49,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:13:49,671 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:13:49,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:13:49,672 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:13:49,673 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:13:49,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:13:49,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:13:49,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:13:49,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:13:49,676 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:13:49,677 INFO L153 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_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/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_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2023-11-21 22:13:50,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:13:50,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:13:50,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:13:50,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:13:50,076 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:13:50,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/memsafety-ext/tree_stack.i [2023-11-21 22:13:53,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:13:53,592 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:13:53,593 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/sv-benchmarks/c/memsafety-ext/tree_stack.i [2023-11-21 22:13:53,613 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/data/294028ba9/c4e689070a98449198022db7f301081c/FLAG07e1ea222 [2023-11-21 22:13:53,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/data/294028ba9/c4e689070a98449198022db7f301081c [2023-11-21 22:13:53,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:13:53,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:13:53,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:13:53,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:13:53,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:13:53,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:13:53" (1/1) ... [2023-11-21 22:13:53,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad8e7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:53, skipping insertion in model container [2023-11-21 22:13:53,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:13:53" (1/1) ... [2023-11-21 22:13:53,708 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:13:54,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:13:54,038 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:13:54,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:13:54,120 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:13:54,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54 WrapperNode [2023-11-21 22:13:54,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:13:54,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:13:54,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:13:54,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:13:54,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,171 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 135 [2023-11-21 22:13:54,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:13:54,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:13:54,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:13:54,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:13:54,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,188 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,205 INFO L187 HeapSplitter]: Split 32 memory accesses to 2 slices as follows [2, 30] [2023-11-21 22:13:54,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:13:54,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:13:54,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:13:54,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:13:54,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (1/1) ... [2023-11-21 22:13:54,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:13:54,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:13:54,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:13:54,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:13:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:13:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:13:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 22:13:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 22:13:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 22:13:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 22:13:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:13:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:13:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:13:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:13:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:13:54,494 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:13:54,496 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:13:54,891 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:13:54,901 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:13:54,902 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:13:54,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:13:54 BoogieIcfgContainer [2023-11-21 22:13:54,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:13:54,905 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:13:54,905 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:13:54,909 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:13:54,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:13:54,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:13:53" (1/3) ... [2023-11-21 22:13:54,912 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@259e42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:13:54, skipping insertion in model container [2023-11-21 22:13:54,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:13:54,916 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:13:54" (2/3) ... [2023-11-21 22:13:54,918 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@259e42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:13:54, skipping insertion in model container [2023-11-21 22:13:54,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:13:54,919 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:13:54" (3/3) ... [2023-11-21 22:13:54,920 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2023-11-21 22:13:54,980 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:13:54,980 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:13:54,980 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:13:54,980 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:13:54,980 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:13:54,981 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:13:54,981 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:13:54,981 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:13:54,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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) [2023-11-21 22:13:55,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-21 22:13:55,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:13:55,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:13:55,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:13:55,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:13:55,014 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:13:55,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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) [2023-11-21 22:13:55,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-21 22:13:55,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:13:55,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:13:55,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:13:55,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:13:55,032 INFO L748 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 11#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~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#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~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#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(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$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 8#L549-4true [2023-11-21 22:13:55,034 INFO L750 eck$LassoCheckResult]: Loop: 8#L549-4true havoc main_#t~nondet4#1; 16#L536-1true 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; 23#L539-2true assume !true; 15#L538-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 9#L544true assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 5#L544-2true assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 6#L544-4true call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 22#L549true assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 19#L549-2true assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 8#L549-4true [2023-11-21 22:13:55,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 22:13:55,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:55,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168283465] [2023-11-21 22:13:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:55,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:13:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:55,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:13:55,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1807228567, now seen corresponding path program 1 times [2023-11-21 22:13:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950827220] [2023-11-21 22:13:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:13:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:13:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:13:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950827220] [2023-11-21 22:13:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950827220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:13:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:13:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:13:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738859464] [2023-11-21 22:13:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:13:55,482 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:13:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:13:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:13:55,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:13:55,532 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-11-21 22:13:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:13:55,543 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2023-11-21 22:13:55,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2023-11-21 22:13:55,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-21 22:13:55,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 30 transitions. [2023-11-21 22:13:55,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-21 22:13:55,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-21 22:13:55,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2023-11-21 22:13:55,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:13:55,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2023-11-21 22:13:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2023-11-21 22:13:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-21 22:13:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 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) [2023-11-21 22:13:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2023-11-21 22:13:55,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 30 transitions. [2023-11-21 22:13:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:13:55,595 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2023-11-21 22:13:55,595 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:13:55,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2023-11-21 22:13:55,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-21 22:13:55,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:13:55,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:13:55,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:13:55,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:13:55,601 INFO L748 eck$LassoCheckResult]: Stem: 72#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 68#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~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#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~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#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(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$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 63#L549-4 [2023-11-21 22:13:55,601 INFO L750 eck$LassoCheckResult]: Loop: 63#L549-4 havoc main_#t~nondet4#1; 64#L536-1 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; 59#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 71#L538-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(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; 56#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 57#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 67#L544 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 60#L544-2 assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 61#L544-4 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 62#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 75#L549-2 assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 63#L549-4 [2023-11-21 22:13:55,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-21 22:13:55,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:55,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602301125] [2023-11-21 22:13:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:55,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:13:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:55,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:13:55,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 639218396, now seen corresponding path program 1 times [2023-11-21 22:13:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755917468] [2023-11-21 22:13:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:55,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:13:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:13:56,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:13:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755917468] [2023-11-21 22:13:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755917468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:13:56,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:13:56,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:13:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560009592] [2023-11-21 22:13:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:13:56,205 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:13:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:13:56,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:13:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:13:56,207 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-11-21 22:13:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:13:56,409 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2023-11-21 22:13:56,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2023-11-21 22:13:56,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2023-11-21 22:13:56,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2023-11-21 22:13:56,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-21 22:13:56,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-21 22:13:56,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2023-11-21 22:13:56,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:13:56,414 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-11-21 22:13:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2023-11-21 22:13:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-11-21 22:13:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 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) [2023-11-21 22:13:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2023-11-21 22:13:56,423 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-11-21 22:13:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:13:56,430 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-11-21 22:13:56,430 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:13:56,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2023-11-21 22:13:56,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-11-21 22:13:56,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:13:56,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:13:56,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:13:56,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:13:56,439 INFO L748 eck$LassoCheckResult]: Stem: 134#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 129#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~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#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~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#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(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$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 124#L549-4 [2023-11-21 22:13:56,439 INFO L750 eck$LassoCheckResult]: Loop: 124#L549-4 havoc main_#t~nondet4#1; 125#L536-1 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#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(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; 132#L538-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(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; 117#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 118#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 128#L544 assume !main_#t~short13#1; 121#L544-2 assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 122#L544-4 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 123#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 137#L549-2 assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; 124#L549-4 [2023-11-21 22:13:56,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-21 22:13:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113280254] [2023-11-21 22:13:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:56,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:13:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:56,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:13:56,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 641065438, now seen corresponding path program 1 times [2023-11-21 22:13:56,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:56,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488233086] [2023-11-21 22:13:56,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:56,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:56,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:13:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:13:56,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:13:56,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash 264589532, now seen corresponding path program 1 times [2023-11-21 22:13:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:56,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758210004] [2023-11-21 22:13:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:13:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:13:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:13:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758210004] [2023-11-21 22:13:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758210004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:13:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:13:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:13:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166293595] [2023-11-21 22:13:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:14:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:14:01,717 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-11-21 22:14:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:01,952 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2023-11-21 22:14:01,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2023-11-21 22:14:01,954 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-21 22:14:01,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 60 transitions. [2023-11-21 22:14:01,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-21 22:14:01,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-21 22:14:01,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2023-11-21 22:14:01,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:01,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-11-21 22:14:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2023-11-21 22:14:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-11-21 22:14:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 35 states have internal predecessors, (51), 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) [2023-11-21 22:14:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-11-21 22:14:01,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-21 22:14:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:14:01,964 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-21 22:14:01,965 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:14:01,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2023-11-21 22:14:01,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2023-11-21 22:14:01,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:01,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:01,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:14:01,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:01,967 INFO L748 eck$LassoCheckResult]: Stem: 218#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 213#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~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#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~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#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(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$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); 206#L549-4 [2023-11-21 22:14:01,968 INFO L750 eck$LassoCheckResult]: Loop: 206#L549-4 havoc main_#t~nondet4#1; 207#L536-1 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; 229#L539-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(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; 216#L538-1 assume !main_#t~short7#1; 198#L538-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 199#L538-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; 208#L544 assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1; 209#L544-2 assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; 204#L544-4 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; 205#L549 assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1; 221#L549-2 assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1; 206#L549-4 [2023-11-21 22:14:01,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:01,968 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-21 22:14:01,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:01,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360433516] [2023-11-21 22:14:01,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:01,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:01,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:01,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash -170128228, now seen corresponding path program 1 times [2023-11-21 22:14:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162146689] [2023-11-21 22:14:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:02,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:02,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:02,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash -546604134, now seen corresponding path program 1 times [2023-11-21 22:14:02,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:02,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750835344] [2023-11-21 22:14:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:02,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:02,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:02,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:02,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:02,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 10:14:02 BoogieIcfgContainer [2023-11-21 22:14:02,785 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-21 22:14:02,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:14:02,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:14:02,786 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:14:02,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:13:54" (3/4) ... [2023-11-21 22:14:02,788 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-21 22:14:02,825 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:14:02,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:14:02,826 INFO L158 Benchmark]: Toolchain (without parser) took 9182.59ms. Allocated memory was 121.6MB in the beginning and 178.3MB in the end (delta: 56.6MB). Free memory was 76.0MB in the beginning and 105.9MB in the end (delta: -29.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,827 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:14:02,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.42ms. Allocated memory is still 121.6MB. Free memory was 75.8MB in the beginning and 58.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 121.6MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,828 INFO L158 Benchmark]: Boogie Preprocessor took 54.13ms. Allocated memory is still 121.6MB. Free memory was 56.0MB in the beginning and 53.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,829 INFO L158 Benchmark]: RCFGBuilder took 677.31ms. Allocated memory was 121.6MB in the beginning and 178.3MB in the end (delta: 56.6MB). Free memory was 53.0MB in the beginning and 131.9MB in the end (delta: -78.9MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,829 INFO L158 Benchmark]: BuchiAutomizer took 7880.09ms. Allocated memory is still 178.3MB. Free memory was 131.9MB in the beginning and 107.0MB in the end (delta: 24.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,830 INFO L158 Benchmark]: Witness Printer took 39.97ms. Allocated memory is still 178.3MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:14:02,832 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.42ms. Allocated memory is still 121.6MB. Free memory was 75.8MB in the beginning and 58.1MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 121.6MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.13ms. Allocated memory is still 121.6MB. Free memory was 56.0MB in the beginning and 53.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 677.31ms. Allocated memory was 121.6MB in the beginning and 178.3MB in the end (delta: 56.6MB). Free memory was 53.0MB in the beginning and 131.9MB in the end (delta: -78.9MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 7880.09ms. Allocated memory is still 178.3MB. Free memory was 131.9MB in the beginning and 107.0MB in the end (delta: 24.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Witness Printer took 39.97ms. Allocated memory is still 178.3MB. Free memory was 107.0MB in the beginning and 105.9MB 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 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.1s. Construction of modules took 0.3s. 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, 14 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, 40 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 84 mSDtfsCounter, 122 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: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] !n->left && __VERIFIER_nondet_int() [L544] !n->left && __VERIFIER_nondet_int() [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] !n->right && __VERIFIER_nondet_int() [L549] !n->right && __VERIFIER_nondet_int() [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] !n->left && __VERIFIER_nondet_int() [L544] !n->left && __VERIFIER_nondet_int() [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] !n->right && __VERIFIER_nondet_int() [L549] !n->right && __VERIFIER_nondet_int() [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-21 22:14:02,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c072160e-7f29-419b-913a-f9f0d63cdf1f/bin/uautomizer-verify-bycVGegfSx/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)