./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 e7bb482b 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_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP --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 --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:08,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:09,101 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:14:09,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:09,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:09,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:09,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:09,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:09,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:09,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:09,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:09,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:09,154 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:09,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:09,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:14:09,156 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:09,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:14:09,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:09,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:09,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:14:09,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:09,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:14:09,193 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:09,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:14:09,194 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:09,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:09,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:09,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:09,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:09,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:09,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:09,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:14:09,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:14:09,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:14:09,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:09,201 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:14:09,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:09,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:09,202 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:09,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/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_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP 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 [2023-11-06 22:14:09,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:09,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:09,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:09,667 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:09,668 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:09,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/verifythis/tree_del_rec.c [2023-11-06 22:14:13,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:13,405 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:13,406 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/sv-benchmarks/c/verifythis/tree_del_rec.c [2023-11-06 22:14:13,414 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/data/96b199177/d016836ff78f424897b5a5574f882cd4/FLAG2e819fe3f [2023-11-06 22:14:13,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/data/96b199177/d016836ff78f424897b5a5574f882cd4 [2023-11-06 22:14:13,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:13,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:13,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:13,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:13,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:13,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b74c551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13, skipping insertion in model container [2023-11-06 22:14:13,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,482 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:13,687 WARN L240 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_e8c460e4-f131-495d-911a-7b9ced71798e/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2023-11-06 22:14:13,707 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 22:14:13,710 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 22:14:13,729 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:13,746 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:13,763 WARN L240 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_e8c460e4-f131-495d-911a-7b9ced71798e/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2023-11-06 22:14:13,771 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 22:14:13,773 WARN L1577 CHandler]: Possible shadowing of function min [2023-11-06 22:14:13,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:13,810 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:13,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13 WrapperNode [2023-11-06 22:14:13,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:13,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:13,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:13,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:13,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,871 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2023-11-06 22:14:13,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:13,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:13,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:13,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:13,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:13,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:13,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:13,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:13,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (1/1) ... [2023-11-06 22:14:13,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:13,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:14:14,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:14:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:14:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:14:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-11-06 22:14:14,051 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-11-06 22:14:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:14:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-11-06 22:14:14,055 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-11-06 22:14:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:14:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-06 22:14:14,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-06 22:14:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:14:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-11-06 22:14:14,057 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-11-06 22:14:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:14:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:14:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-11-06 22:14:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-11-06 22:14:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:14,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:14:14,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:14:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-11-06 22:14:14,060 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-11-06 22:14:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:14:14,218 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:14,221 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:14,698 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:14,718 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:14,720 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:14:14,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:14 BoogieIcfgContainer [2023-11-06 22:14:14,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:14,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:14,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:14,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:14,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:13" (1/3) ... [2023-11-06 22:14:14,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dfb3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:14, skipping insertion in model container [2023-11-06 22:14:14,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:13" (2/3) ... [2023-11-06 22:14:14,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dfb3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:14, skipping insertion in model container [2023-11-06 22:14:14,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:14" (3/3) ... [2023-11-06 22:14:14,734 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2023-11-06 22:14:14,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:14,757 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:14:14,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:14,830 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;@402fac2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:14,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:14:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 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) [2023-11-06 22:14:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:14:14,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:14,862 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, 1] [2023-11-06 22:14:14,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:14,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1966822033, now seen corresponding path program 1 times [2023-11-06 22:14:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:14,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875367964] [2023-11-06 22:14:14,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:14,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:14:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:15,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:15,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:14:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:15,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:15,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875367964] [2023-11-06 22:14:15,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875367964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:15,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:15,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:14:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959780508] [2023-11-06 22:14:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:14:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:14:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:14:15,751 INFO L87 Difference]: Start difference. First operand has 87 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 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.25) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-06 22:14:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:16,363 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2023-11-06 22:14:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:14:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2023-11-06 22:14:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:16,384 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:14:16,385 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:14:16,390 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 [2023-11-06 22:14:16,399 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:16,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 272 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:14:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:14:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2023-11-06 22:14:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 53 states have internal predecessors, (60), 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) [2023-11-06 22:14:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2023-11-06 22:14:16,536 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 37 [2023-11-06 22:14:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:16,537 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2023-11-06 22:14:16,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-06 22:14:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2023-11-06 22:14:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-06 22:14:16,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:16,542 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, 1] [2023-11-06 22:14:16,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:14:16,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:16,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1166479438, now seen corresponding path program 1 times [2023-11-06 22:14:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:16,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798281119] [2023-11-06 22:14:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:14:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:14:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798281119] [2023-11-06 22:14:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798281119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754737724] [2023-11-06 22:14:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:17,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:17,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:14:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:17,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:14:17,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:14:17,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:14:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:14:17,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754737724] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:14:17,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:14:17,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2023-11-06 22:14:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258091831] [2023-11-06 22:14:17,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:14:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:14:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:17,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:14:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:14:17,921 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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) [2023-11-06 22:14:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:18,612 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2023-11-06 22:14:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:14:18,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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 49 [2023-11-06 22:14:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:18,626 INFO L225 Difference]: With dead ends: 150 [2023-11-06 22:14:18,631 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 22:14:18,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:14:18,635 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 109 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:18,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 271 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:14:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 22:14:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2023-11-06 22:14:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.150943396226415) internal successors, (61), 55 states have internal predecessors, (61), 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) [2023-11-06 22:14:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2023-11-06 22:14:18,677 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 49 [2023-11-06 22:14:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:18,678 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2023-11-06 22:14:18,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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) [2023-11-06 22:14:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2023-11-06 22:14:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:14:18,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:18,692 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 22:14:18,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:18,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:18,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:18,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 698295147, now seen corresponding path program 1 times [2023-11-06 22:14:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538186649] [2023-11-06 22:14:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:14:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:14:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:14:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:14:19,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538186649] [2023-11-06 22:14:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538186649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:19,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:14:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565811682] [2023-11-06 22:14:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:19,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:14:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:19,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:14:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:14:19,396 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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) [2023-11-06 22:14:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:19,985 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2023-11-06 22:14:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:14:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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 61 [2023-11-06 22:14:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:19,988 INFO L225 Difference]: With dead ends: 150 [2023-11-06 22:14:19,988 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:14:19,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:14:20,001 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 109 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:20,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 360 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:14:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:14:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2023-11-06 22:14:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 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) [2023-11-06 22:14:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2023-11-06 22:14:20,031 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 61 [2023-11-06 22:14:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:20,032 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2023-11-06 22:14:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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) [2023-11-06 22:14:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2023-11-06 22:14:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 22:14:20,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:20,036 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 22:14:20,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:14:20,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:20,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1002320777, now seen corresponding path program 1 times [2023-11-06 22:14:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934434233] [2023-11-06 22:14:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:14:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:14:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:14:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:14:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:14:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:14:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934434233] [2023-11-06 22:14:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934434233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:14:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205459049] [2023-11-06 22:14:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:20,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:20,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:20,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:14:20,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:14:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:20,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:14:20,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:14:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 22:14:21,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:14:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205459049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:14:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-11-06 22:14:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427040118] [2023-11-06 22:14:21,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:21,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:14:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:14:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:14:21,029 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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) [2023-11-06 22:14:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:21,198 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2023-11-06 22:14:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:14:21,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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 74 [2023-11-06 22:14:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:21,201 INFO L225 Difference]: With dead ends: 141 [2023-11-06 22:14:21,202 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:14:21,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:14:21,204 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:21,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 590 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:14:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:14:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-06 22:14:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 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) [2023-11-06 22:14:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2023-11-06 22:14:21,230 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 74 [2023-11-06 22:14:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:21,231 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2023-11-06 22:14:21,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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) [2023-11-06 22:14:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2023-11-06 22:14:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:14:21,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:21,235 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-06 22:14:21,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:14:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:14:21,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:21,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1462059108, now seen corresponding path program 1 times [2023-11-06 22:14:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456733463] [2023-11-06 22:14:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:21,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:14:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:21,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:14:21,631 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:14:21,633 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:14:21,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:14:21,664 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:14:21,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:14:21,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:14:21 BoogieIcfgContainer [2023-11-06 22:14:21,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:14:21,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:14:21,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:14:21,784 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:14:21,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:14" (3/4) ... [2023-11-06 22:14:21,786 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:14:21,880 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:14:21,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:14:21,881 INFO L158 Benchmark]: Toolchain (without parser) took 8443.51ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 150.4MB in the beginning and 174.6MB in the end (delta: -24.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,882 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 134.2MB. Free memory was 108.5MB in the beginning and 108.3MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:21,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.09ms. Allocated memory is still 178.3MB. Free memory was 150.2MB in the beginning and 141.4MB in the end (delta: 8.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 178.3MB. Free memory was 141.4MB in the beginning and 140.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,883 INFO L158 Benchmark]: Boogie Preprocessor took 67.63ms. Allocated memory is still 178.3MB. Free memory was 140.0MB in the beginning and 138.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,884 INFO L158 Benchmark]: RCFGBuilder took 780.94ms. Allocated memory is still 178.3MB. Free memory was 138.0MB in the beginning and 137.1MB in the end (delta: 913.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,884 INFO L158 Benchmark]: TraceAbstraction took 7057.34ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.2MB in the beginning and 178.8MB in the end (delta: -42.6MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,885 INFO L158 Benchmark]: Witness Printer took 96.78ms. Allocated memory is still 213.9MB. Free memory was 178.8MB in the beginning and 174.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:21,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 134.2MB. Free memory was 108.5MB in the beginning and 108.3MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.09ms. Allocated memory is still 178.3MB. Free memory was 150.2MB in the beginning and 141.4MB in the end (delta: 8.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 178.3MB. Free memory was 141.4MB in the beginning and 140.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.63ms. Allocated memory is still 178.3MB. Free memory was 140.0MB in the beginning and 138.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 780.94ms. Allocated memory is still 178.3MB. Free memory was 138.0MB in the beginning and 137.1MB in the end (delta: 913.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7057.34ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.2MB in the beginning and 178.8MB in the end (delta: -42.6MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. * Witness Printer took 96.78ms. Allocated memory is still 213.9MB. Free memory was 178.8MB in the beginning and 174.6MB 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->left={0:0}, n={-1:0}, n={-1: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->left={0:0}, n={-1:0}, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n->right={0:0}, n={-1:0}, n={-1: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->right={0:0}, n={-1:0}, n={-1: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->left={0:0}, t={-1:0}, t={-1: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->left={0:0}, t={-1:0}, t={-1:0}] [L74] EXPR t->right VAL [size(t->left)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1: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->left={0:0}, t->right={0:0}, t={-1:0}, t={-1: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->left={0:0}, t={-1:0}, t={-1: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->left={0:0}, t={-1:0}, t={-1: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->right={0:0}, t={-1:0}, t={-1: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->right={0:0}, t={-1:0}, t={-1: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, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 1493 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1213 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1063 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 280 mSDtfsCounter, 1063 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 10 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 124/132 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! [2023-11-06 22:14:21,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8c460e4-f131-495d-911a-7b9ced71798e/bin/uautomizer-verify-WvqO1wxjHP/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