./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_del_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- 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-e04fb08 [2022-11-16 11:43:31,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:43:31,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:43:31,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:43:31,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:43:31,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:43:31,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:43:31,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:43:31,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:43:31,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:43:31,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:43:31,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:43:31,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:43:31,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:43:31,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:43:31,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:43:31,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:43:31,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:43:31,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:43:31,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:43:31,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:43:31,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:43:31,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:43:31,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:43:31,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:43:31,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:43:31,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:43:31,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:43:31,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:43:31,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:43:31,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:43:31,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:43:31,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:43:31,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:43:31,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:43:31,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:43:31,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:43:31,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:43:31,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:43:31,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:43:31,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:43:31,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:43:31,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:43:31,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:43:31,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:43:31,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:43:31,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:43:31,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:43:31,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:43:31,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:43:31,131 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:43:31,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:43:31,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:43:31,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:43:31,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:43:31,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:43:31,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:43:31,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:43:31,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:43:31,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:43:31,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:43:31,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:43:31,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:43:31,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:43:31,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:43:31,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:43:31,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:43:31,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:43:31,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:43:31,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:43:31,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:43:31,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:43:31,137 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:43:31,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:43:31,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:43:31,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/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_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8 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(G ! call(reach_error())) ) 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2022-11-16 11:43:31,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:43:31,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:43:31,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:43:31,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:43:31,466 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:43:31,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-16 11:43:31,556 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/data/5c12f7122/9b78f1886a8a49729a56d1db91ed854c/FLAG7824d1958 [2022-11-16 11:43:32,077 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:43:32,078 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-16 11:43:32,088 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/data/5c12f7122/9b78f1886a8a49729a56d1db91ed854c/FLAG7824d1958 [2022-11-16 11:43:32,419 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/data/5c12f7122/9b78f1886a8a49729a56d1db91ed854c [2022-11-16 11:43:32,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:43:32,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:43:32,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:43:32,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:43:32,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:43:32,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6942e059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32, skipping insertion in model container [2022-11-16 11:43:32,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:43:32,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:43:32,624 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-16 11:43:32,641 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 11:43:32,643 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 11:43:32,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:43:32,671 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:43:32,684 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-16 11:43:32,690 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 11:43:32,691 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 11:43:32,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:43:32,716 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:43:32,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32 WrapperNode [2022-11-16 11:43:32,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:43:32,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:43:32,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:43:32,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:43:32,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,758 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-11-16 11:43:32,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:43:32,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:43:32,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:43:32,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:43:32,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,818 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:43:32,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:43:32,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:43:32,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:43:32,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (1/1) ... [2022-11-16 11:43:32,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:43:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:32,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:43:32,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:43:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:43:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:43:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:43:32,901 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-11-16 11:43:32,901 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-11-16 11:43:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:43:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-11-16 11:43:32,902 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-11-16 11:43:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:43:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 11:43:32,902 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 11:43:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:43:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-16 11:43:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-16 11:43:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:43:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:43:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-11-16 11:43:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-11-16 11:43:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:43:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:43:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:43:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:43:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-11-16 11:43:32,904 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-11-16 11:43:32,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:43:33,016 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:43:33,018 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:43:33,453 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:43:33,468 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:43:33,469 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:43:33,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:43:33 BoogieIcfgContainer [2022-11-16 11:43:33,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:43:33,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:43:33,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:43:33,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:43:33,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:43:32" (1/3) ... [2022-11-16 11:43:33,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2a630c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:43:33, skipping insertion in model container [2022-11-16 11:43:33,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:32" (2/3) ... [2022-11-16 11:43:33,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2a630c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:43:33, skipping insertion in model container [2022-11-16 11:43:33,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:43:33" (3/3) ... [2022-11-16 11:43:33,486 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2022-11-16 11:43:33,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:43:33,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:43:33,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:43:33,570 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d2769ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:43:33,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:43:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 11:43:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:43:33,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:33,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:33,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 909892653, now seen corresponding path program 1 times [2022-11-16 11:43:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:33,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955764371] [2022-11-16 11:43:33,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:43:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:43:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:43:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:43:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955764371] [2022-11-16 11:43:34,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955764371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:34,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:34,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:43:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215225004] [2022-11-16 11:43:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:34,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:43:34,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:43:34,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:43:34,337 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:43:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:34,731 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2022-11-16 11:43:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:43:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-11-16 11:43:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:34,746 INFO L225 Difference]: With dead ends: 155 [2022-11-16 11:43:34,746 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 11:43:34,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:43:34,753 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:34,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 266 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:43:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 11:43:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-11-16 11:43:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-11-16 11:43:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-11-16 11:43:34,814 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 36 [2022-11-16 11:43:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:34,815 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-11-16 11:43:34,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 11:43:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-11-16 11:43:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:43:34,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:34,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:34,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:43:34,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1373837682, now seen corresponding path program 1 times [2022-11-16 11:43:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:34,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113747999] [2022-11-16 11:43:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:43:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:43:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:43:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 11:43:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:43:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:43:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:35,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113747999] [2022-11-16 11:43:35,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113747999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:35,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93320978] [2022-11-16 11:43:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:35,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:35,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:35,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:43:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:43:35,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:43:35,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:43:36,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93320978] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:43:36,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:43:36,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2022-11-16 11:43:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024384464] [2022-11-16 11:43:36,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:43:36,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:43:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:43:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:43:36,075 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:43:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:36,725 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-11-16 11:43:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:43:36,726 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-11-16 11:43:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:36,736 INFO L225 Difference]: With dead ends: 149 [2022-11-16 11:43:36,737 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 11:43:36,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:43:36,743 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 73 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:36,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 319 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:43:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 11:43:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-11-16 11:43:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2022-11-16 11:43:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2022-11-16 11:43:36,769 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 48 [2022-11-16 11:43:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:36,769 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2022-11-16 11:43:36,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:43:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2022-11-16 11:43:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:43:36,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:36,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:36,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:36,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:36,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1481222417, now seen corresponding path program 1 times [2022-11-16 11:43:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:36,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215750910] [2022-11-16 11:43:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:43:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:43:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:43:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:43:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:43:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:43:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:43:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 11:43:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215750910] [2022-11-16 11:43:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215750910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:37,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:37,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:43:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998457779] [2022-11-16 11:43:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:37,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:43:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:43:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:43:37,316 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 11:43:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:37,857 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-11-16 11:43:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:43:37,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2022-11-16 11:43:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:37,862 INFO L225 Difference]: With dead ends: 149 [2022-11-16 11:43:37,862 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:43:37,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:43:37,867 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 77 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:37,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 334 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:43:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:43:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-11-16 11:43:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2022-11-16 11:43:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2022-11-16 11:43:37,902 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 58 [2022-11-16 11:43:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:37,902 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2022-11-16 11:43:37,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 11:43:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2022-11-16 11:43:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-16 11:43:37,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:37,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:37,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:43:37,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1364034462, now seen corresponding path program 1 times [2022-11-16 11:43:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:37,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082567392] [2022-11-16 11:43:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:43:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:43:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:43:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:43:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:43:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:43:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-16 11:43:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:43:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:43:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 11:43:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:43:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082567392] [2022-11-16 11:43:38,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082567392] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:38,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295369285] [2022-11-16 11:43:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:43:38,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:43:38,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:43:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:38,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:43:38,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-16 11:43:38,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295369285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:38,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:43:38,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2022-11-16 11:43:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402894374] [2022-11-16 11:43:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:43:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:43:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:43:38,780 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 11:43:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:38,945 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2022-11-16 11:43:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:43:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2022-11-16 11:43:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:38,951 INFO L225 Difference]: With dead ends: 140 [2022-11-16 11:43:38,951 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 11:43:38,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:43:38,956 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:38,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 548 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:43:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 11:43:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-16 11:43:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 58 states have internal predecessors, (62), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2022-11-16 11:43:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2022-11-16 11:43:38,988 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 71 [2022-11-16 11:43:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:38,989 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2022-11-16 11:43:38,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-16 11:43:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-11-16 11:43:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 11:43:38,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:38,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:39,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:39,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-16 11:43:39,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1861975499, now seen corresponding path program 1 times [2022-11-16 11:43:39,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:39,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701384808] [2022-11-16 11:43:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:43:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:39,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:39,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:43:39,330 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:43:39,332 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:43:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:43:39,337 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-16 11:43:39,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:43:39,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:43:39 BoogieIcfgContainer [2022-11-16 11:43:39,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:43:39,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:43:39,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:43:39,407 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:43:39,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:43:33" (3/4) ... [2022-11-16 11:43:39,409 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:43:39,467 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:43:39,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:43:39,468 INFO L158 Benchmark]: Toolchain (without parser) took 7044.69ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 111.3MB in the beginning and 132.0MB in the end (delta: -20.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,469 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 81.8MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:43:39,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.08ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 118.6MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.13ms. Allocated memory is still 144.7MB. Free memory was 118.6MB in the beginning and 116.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,470 INFO L158 Benchmark]: Boogie Preprocessor took 64.59ms. Allocated memory is still 144.7MB. Free memory was 116.9MB in the beginning and 115.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,470 INFO L158 Benchmark]: RCFGBuilder took 646.72ms. Allocated memory is still 144.7MB. Free memory was 114.8MB in the beginning and 94.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,470 INFO L158 Benchmark]: TraceAbstraction took 5932.28ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 94.2MB in the beginning and 136.2MB in the end (delta: -42.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,471 INFO L158 Benchmark]: Witness Printer took 60.43ms. Allocated memory is still 199.2MB. Free memory was 136.2MB in the beginning and 132.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:43:39,473 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.27ms. Allocated memory is still 81.8MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.08ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 118.6MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.13ms. Allocated memory is still 144.7MB. Free memory was 118.6MB in the beginning and 116.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.59ms. Allocated memory is still 144.7MB. Free memory was 116.9MB in the beginning and 115.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.72ms. Allocated memory is still 144.7MB. Free memory was 114.8MB in the beginning and 94.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5932.28ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 94.2MB in the beginning and 136.2MB in the end (delta: -42.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Witness Printer took 60.43ms. Allocated memory is still 199.2MB. Free memory was 136.2MB in the beginning and 132.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L102] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L102] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L78] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [t={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L85] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L85] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 1467 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1190 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1268 IncrementalHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 277 mSDtfsCounter, 1268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 10 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 115/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:43:39,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80b6280a-6639-49be-beab-8c17d66d550f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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