./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- [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-2329fc7 [2022-12-13 18:01:18,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:01:18,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:01:18,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:01:18,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:01:18,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:01:18,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:01:18,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:01:18,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:01:18,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:01:18,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:01:18,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:01:18,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:01:18,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:01:18,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:01:18,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:01:18,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:01:18,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:01:18,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:01:18,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:01:18,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:01:18,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:01:18,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:01:18,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:01:18,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:01:18,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:01:18,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:01:18,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:01:18,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:01:18,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:01:18,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:01:18,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:01:18,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:01:18,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:01:18,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:01:18,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:01:18,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:01:18,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:01:18,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:01:18,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:01:18,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:01:18,382 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 18:01:18,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:01:18,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:01:18,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:01:18,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:01:18,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:01:18,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:01:18,407 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:01:18,407 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 18:01:18,407 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 18:01:18,407 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 18:01:18,407 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 18:01:18,408 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 18:01:18,408 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 18:01:18,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:01:18,408 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:01:18,408 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:01:18,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:01:18,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:01:18,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:01:18,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 18:01:18,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 18:01:18,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 18:01:18,410 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:01:18,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:01:18,410 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 18:01:18,410 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:01:18,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 18:01:18,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:01:18,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:01:18,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:01:18,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:01:18,412 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 18:01:18,412 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_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/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_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2022-12-13 18:01:18,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:01:18,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:01:18,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:01:18,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:01:18,633 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:01:18,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-12-13 18:01:21,179 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:01:21,403 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:01:21,404 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-12-13 18:01:21,413 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/data/7c16c3fa7/9bc8dcb6f5fb42dbbecaeda52efa7a51/FLAG1bd99214e [2022-12-13 18:01:21,427 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/data/7c16c3fa7/9bc8dcb6f5fb42dbbecaeda52efa7a51 [2022-12-13 18:01:21,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:01:21,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:01:21,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:01:21,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:01:21,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:01:21,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd2f388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21, skipping insertion in model container [2022-12-13 18:01:21,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:01:21,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:01:21,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:01:21,722 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:01:21,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:01:21,785 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:01:21,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21 WrapperNode [2022-12-13 18:01:21,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:01:21,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:01:21,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:01:21,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:01:21,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,832 INFO L138 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2022-12-13 18:01:21,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:01:21,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:01:21,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:01:21,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:01:21,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,862 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:01:21,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:01:21,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:01:21,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:01:21,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (1/1) ... [2022-12-13 18:01:21,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:01:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:01:21,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:01:21,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 18:01:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:01:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:01:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 18:01:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 18:01:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:01:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:01:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:01:21,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:01:22,020 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:01:22,022 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:01:22,348 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:01:22,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:01:22,354 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 18:01:22,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:01:22 BoogieIcfgContainer [2022-12-13 18:01:22,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:01:22,357 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 18:01:22,358 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 18:01:22,361 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 18:01:22,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 18:01:22,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 06:01:21" (1/3) ... [2022-12-13 18:01:22,363 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61067889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 06:01:22, skipping insertion in model container [2022-12-13 18:01:22,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 18:01:22,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:01:21" (2/3) ... [2022-12-13 18:01:22,364 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61067889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 06:01:22, skipping insertion in model container [2022-12-13 18:01:22,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 18:01:22,364 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:01:22" (3/3) ... [2022-12-13 18:01:22,365 INFO L332 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2022-12-13 18:01:22,417 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 18:01:22,417 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 18:01:22,417 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 18:01:22,417 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 18:01:22,417 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 18:01:22,417 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 18:01:22,417 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 18:01:22,417 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 18:01:22,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:22,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 18:01:22,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:01:22,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:01:22,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 18:01:22,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:01:22,438 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 18:01:22,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:22,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 18:01:22,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:01:22,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:01:22,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 18:01:22,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 18:01:22,445 INFO L748 eck$LassoCheckResult]: Stem: 16#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 12#L552-2true [2022-12-13 18:01:22,445 INFO L750 eck$LassoCheckResult]: Loop: 12#L552-2true assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 21#L541-2true assume !true; 5#L540-5true call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 4#L546true assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem16#1.base, 8 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 13#L546-2true call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 10#L552true assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 12#L552-2true [2022-12-13 18:01:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 18:01:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:22,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639486420] [2022-12-13 18:01:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:22,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:22,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:22,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2022-12-13 18:01:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:22,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225173524] [2022-12-13 18:01:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:01:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:01:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:01:22,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225173524] [2022-12-13 18:01:22,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225173524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:01:22,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:01:22,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:01:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377916186] [2022-12-13 18:01:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:01:22,772 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:01:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:01:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:01:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:01:22,799 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:01:22,804 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-12-13 18:01:22,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2022-12-13 18:01:22,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 18:01:22,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2022-12-13 18:01:22,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-12-13 18:01:22,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-12-13 18:01:22,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2022-12-13 18:01:22,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:01:22,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-12-13 18:01:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2022-12-13 18:01:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-13 18:01:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-12-13 18:01:22,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-12-13 18:01:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:01:22,834 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-12-13 18:01:22,834 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 18:01:22,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-12-13 18:01:22,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 18:01:22,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:01:22,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:01:22,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 18:01:22,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:01:22,836 INFO L748 eck$LassoCheckResult]: Stem: 64#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 60#L552-2 [2022-12-13 18:01:22,836 INFO L750 eck$LassoCheckResult]: Loop: 60#L552-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 63#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 50#L540-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 51#L540-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 54#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 52#L546 assume (main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, main_#t~mem16#1.base, 8 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; 53#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 61#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 60#L552-2 [2022-12-13 18:01:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 18:01:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:22,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905069188] [2022-12-13 18:01:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:22,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:22,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2022-12-13 18:01:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:22,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471595513] [2022-12-13 18:01:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:01:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:01:23,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:01:23,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471595513] [2022-12-13 18:01:23,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471595513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:01:23,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:01:23,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:01:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967571719] [2022-12-13 18:01:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:01:23,536 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:01:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:01:23,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:01:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:01:23,537 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:01:23,675 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-12-13 18:01:23,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-12-13 18:01:23,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-12-13 18:01:23,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2022-12-13 18:01:23,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-12-13 18:01:23,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-12-13 18:01:23,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2022-12-13 18:01:23,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:01:23,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-12-13 18:01:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2022-12-13 18:01:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-12-13 18:01:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-12-13 18:01:23,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-12-13 18:01:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:01:23,681 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-12-13 18:01:23,681 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 18:01:23,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-12-13 18:01:23,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-12-13 18:01:23,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:01:23,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:01:23,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 18:01:23,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:01:23,683 INFO L748 eck$LassoCheckResult]: Stem: 118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 111#L552-2 [2022-12-13 18:01:23,683 INFO L750 eck$LassoCheckResult]: Loop: 111#L552-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 117#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 101#L540-1 assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; 102#L540-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 113#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 104#L546 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 105#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 115#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 111#L552-2 [2022-12-13 18:01:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 18:01:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:23,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394736755] [2022-12-13 18:01:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:23,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:23,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2022-12-13 18:01:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384148649] [2022-12-13 18:01:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:23,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:23,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2022-12-13 18:01:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:23,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620738361] [2022-12-13 18:01:23,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:01:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:01:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:01:23,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620738361] [2022-12-13 18:01:23,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620738361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:01:23,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:01:23,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:01:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822948139] [2022-12-13 18:01:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:01:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:01:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:01:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:01:24,044 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:01:24,306 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-12-13 18:01:24,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2022-12-13 18:01:24,307 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-12-13 18:01:24,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2022-12-13 18:01:24,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-12-13 18:01:24,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-12-13 18:01:24,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2022-12-13 18:01:24,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:01:24,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-12-13 18:01:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2022-12-13 18:01:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-12-13 18:01:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:01:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-12-13 18:01:24,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-12-13 18:01:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:01:24,311 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-12-13 18:01:24,311 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 18:01:24,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2022-12-13 18:01:24,313 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2022-12-13 18:01:24,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:01:24,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:01:24,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 18:01:24,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:01:24,313 INFO L748 eck$LassoCheckResult]: Stem: 188#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); 177#L552-2 [2022-12-13 18:01:24,313 INFO L750 eck$LassoCheckResult]: Loop: 177#L552-2 assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; 183#L541-2 call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; 168#L540-1 assume !main_#t~short7#1; 169#L540-3 assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; 195#L540-5 call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); 194#L546 assume !((main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0) && 0 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; 184#L546-2 call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); 185#L552 assume !((main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0) && 0 != main_#t~nondet18#1);havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1; 177#L552-2 [2022-12-13 18:01:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 18:01:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:24,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678886276] [2022-12-13 18:01:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2022-12-13 18:01:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:24,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834231394] [2022-12-13 18:01:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:01:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2022-12-13 18:01:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:01:24,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722899785] [2022-12-13 18:01:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:01:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:01:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:01:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:01:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:01:24,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 06:01:24 BoogieIcfgContainer [2022-12-13 18:01:24,965 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 18:01:24,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:01:24,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:01:24,966 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:01:24,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:01:22" (3/4) ... [2022-12-13 18:01:24,968 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 18:01:24,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:01:24,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:01:25,000 INFO L158 Benchmark]: Toolchain (without parser) took 3569.37ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 113.4MB in the beginning and 66.9MB in the end (delta: 46.5MB). Peak memory consumption was 107.5MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,001 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:01:25,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.87ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 96.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.32ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 93.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,002 INFO L158 Benchmark]: Boogie Preprocessor took 34.02ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,003 INFO L158 Benchmark]: RCFGBuilder took 488.72ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 92.4MB in the beginning and 178.3MB in the end (delta: -85.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,003 INFO L158 Benchmark]: BuchiAutomizer took 2607.59ms. Allocated memory is still 209.7MB. Free memory was 178.2MB in the beginning and 68.9MB in the end (delta: 109.3MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,003 INFO L158 Benchmark]: Witness Printer took 33.97ms. Allocated memory is still 209.7MB. Free memory was 68.9MB in the beginning and 66.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:01:25,006 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.87ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 96.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.32ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 93.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.02ms. Allocated memory is still 151.0MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.72ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 92.4MB in the beginning and 178.3MB in the end (delta: -85.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2607.59ms. Allocated memory is still 209.7MB. Free memory was 178.2MB in the beginning and 68.9MB in the end (delta: 109.3MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 33.97ms. Allocated memory is still 209.7MB. Free memory was 68.9MB in the beginning and 66.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 68 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 538]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) VAL [root={-1:0}] Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 538]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] struct TreeNode* root = malloc(sizeof(*root)), *n; [L535] root->left = ((void *)0) [L536] root->right = ((void *)0) [L537] root->parent = ((void *)0) VAL [root={-1:0}] Loop: [L538] COND TRUE __VERIFIER_nondet_int() [L539] n = root [L540] EXPR n->left [L540] n->left && n->right [L540] COND FALSE !(n->left && n->right) [L546] EXPR n->left [L546] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L552] EXPR n->right [L552] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 18:01:25,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465cd830-7d01-46ad-8e93-e32eaa5bf923/bin/uautomizer-uyxdKDjOR8/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)