./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:25:12,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:25:13,093 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-02 12:25:13,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:25:13,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:25:13,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:25:13,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:25:13,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:25:13,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:25:13,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:25:13,149 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:25:13,150 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:25:13,150 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:25:13,150 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:25:13,151 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:25:13,151 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:25:13,151 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:25:13,151 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:25:13,154 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:25:13,155 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:25:13,155 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:25:13,157 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:25:13,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:25:13,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 12:25:13,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:25:13,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:25:13,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:25:13,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:25:13,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 12:25:13,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:25:13,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 12:25:13,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:25:13,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:25:13,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 12:25:13,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:25:13,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:25:13,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:25:13,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:25:13,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:13,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:25:13,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:25:13,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 12:25:13,165 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:25:13,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:25:13,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:25:13,166 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:25:13,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:25:13,166 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/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_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2024-11-02 12:25:13,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:25:13,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:25:13,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:25:13,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:25:13,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:25:13,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c Unable to find full path for "g++" [2024-11-02 12:25:15,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:25:15,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:25:15,884 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-11-02 12:25:15,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/data/d87f33b69/6c8919a9fc7844fe8b23421fc5a305d7/FLAGc0da09a11 [2024-11-02 12:25:16,190 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/data/d87f33b69/6c8919a9fc7844fe8b23421fc5a305d7 [2024-11-02 12:25:16,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:25:16,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:25:16,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:25:16,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:25:16,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:25:16,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c837f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16, skipping insertion in model container [2024-11-02 12:25:16,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:25:16,439 WARN L251 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_ff87624d-4687-4768-bb4c-754040b5463b/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-11-02 12:25:16,454 WARN L1657 CHandler]: Possible shadowing of function min [2024-11-02 12:25:16,456 WARN L1657 CHandler]: Possible shadowing of function min [2024-11-02 12:25:16,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:25:16,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:25:16,507 WARN L251 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_ff87624d-4687-4768-bb4c-754040b5463b/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-11-02 12:25:16,512 WARN L1657 CHandler]: Possible shadowing of function min [2024-11-02 12:25:16,514 WARN L1657 CHandler]: Possible shadowing of function min [2024-11-02 12:25:16,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:25:16,549 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:25:16,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16 WrapperNode [2024-11-02 12:25:16,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:25:16,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:25:16,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:25:16,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:25:16,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,591 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-02 12:25:16,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:25:16,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:25:16,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:25:16,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:25:16,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:25:16,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:25:16,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:25:16,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:25:16,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:16,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:25:16,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:25:16,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:25:16,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 12:25:16,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 12:25:16,712 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-11-02 12:25:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-11-02 12:25:16,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 12:25:16,713 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-02 12:25:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-02 12:25:16,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 12:25:16,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-02 12:25:16,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-02 12:25:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 12:25:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-02 12:25:16,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-02 12:25:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:25:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 12:25:16,714 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-02 12:25:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-02 12:25:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:25:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:25:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-02 12:25:16,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-02 12:25:16,715 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-02 12:25:16,716 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-02 12:25:16,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:25:16,851 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:25:16,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:25:17,181 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-02 12:25:17,181 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:25:17,223 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:25:17,223 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-02 12:25:17,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:17 BoogieIcfgContainer [2024-11-02 12:25:17,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:25:17,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:25:17,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:25:17,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:25:17,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:25:16" (1/3) ... [2024-11-02 12:25:17,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d518b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:25:17, skipping insertion in model container [2024-11-02 12:25:17,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (2/3) ... [2024-11-02 12:25:17,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d518b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:25:17, skipping insertion in model container [2024-11-02 12:25:17,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:17" (3/3) ... [2024-11-02 12:25:17,237 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2024-11-02 12:25:17,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:25:17,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 12:25:17,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:25:17,354 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5e4a1b22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:25:17,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 12:25:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 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) [2024-11-02 12:25:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 12:25:17,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:17,375 INFO L215 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] [2024-11-02 12:25:17,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:17,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:17,385 INFO L85 PathProgramCache]: Analyzing trace with hash 850479651, now seen corresponding path program 1 times [2024-11-02 12:25:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879849797] [2024-11-02 12:25:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:25:17,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879849797] [2024-11-02 12:25:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879849797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:17,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:17,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:25:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633720049] [2024-11-02 12:25:17,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:17,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:25:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:25:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:25:17,939 INFO L87 Difference]: Start difference. First operand has 75 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-02 12:25:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:18,007 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2024-11-02 12:25:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:25:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 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 33 [2024-11-02 12:25:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:18,020 INFO L225 Difference]: With dead ends: 130 [2024-11-02 12:25:18,021 INFO L226 Difference]: Without dead ends: 76 [2024-11-02 12:25:18,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:25:18,028 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:18,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:25:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-02 12:25:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-02 12:25:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 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) [2024-11-02 12:25:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2024-11-02 12:25:18,089 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 33 [2024-11-02 12:25:18,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:18,090 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2024-11-02 12:25:18,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-02 12:25:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2024-11-02 12:25:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-02 12:25:18,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:18,128 INFO L215 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] [2024-11-02 12:25:18,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:25:18,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:18,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1524002030, now seen corresponding path program 1 times [2024-11-02 12:25:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:18,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273016046] [2024-11-02 12:25:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 12:25:18,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273016046] [2024-11-02 12:25:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273016046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:18,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523962009] [2024-11-02 12:25:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:18,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:18,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:18,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:18,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:25:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:18,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-02 12:25:18,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 12:25:18,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 12:25:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523962009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:25:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142733349] [2024-11-02 12:25:19,278 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2024-11-02 12:25:19,278 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:25:19,283 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-02 12:25:19,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:25:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2024-11-02 12:25:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274734469] [2024-11-02 12:25:19,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:25:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-02 12:25:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-02 12:25:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-02 12:25:19,289 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-02 12:25:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:19,466 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-02 12:25:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 12:25:19,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 45 [2024-11-02 12:25:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:19,469 INFO L225 Difference]: With dead ends: 136 [2024-11-02 12:25:19,470 INFO L226 Difference]: Without dead ends: 78 [2024-11-02 12:25:19,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-02 12:25:19,472 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:19,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 571 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:25:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-02 12:25:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-02 12:25:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 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) [2024-11-02 12:25:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-02 12:25:19,493 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 45 [2024-11-02 12:25:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:19,493 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-02 12:25:19,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-02 12:25:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-02 12:25:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-02 12:25:19,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:19,497 INFO L215 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] [2024-11-02 12:25:19,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 12:25:19,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:19,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:19,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -260838639, now seen corresponding path program 1 times [2024-11-02 12:25:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:19,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304114126] [2024-11-02 12:25:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:19,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-02 12:25:19,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304114126] [2024-11-02 12:25:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304114126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-02 12:25:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659441665] [2024-11-02 12:25:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:19,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 12:25:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 12:25:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:25:19,994 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-02 12:25:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:20,118 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-02 12:25:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 12:25:20,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (10), 2 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 57 [2024-11-02 12:25:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:20,120 INFO L225 Difference]: With dead ends: 136 [2024-11-02 12:25:20,121 INFO L226 Difference]: Without dead ends: 80 [2024-11-02 12:25:20,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:25:20,125 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:20,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 551 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:25:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-02 12:25:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-02 12:25:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 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) [2024-11-02 12:25:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-11-02 12:25:20,151 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 57 [2024-11-02 12:25:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:20,151 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-11-02 12:25:20,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-02 12:25:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-11-02 12:25:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-02 12:25:20,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:20,154 INFO L215 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] [2024-11-02 12:25:20,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:25:20,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -668470674, now seen corresponding path program 1 times [2024-11-02 12:25:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129259449] [2024-11-02 12:25:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-02 12:25:20,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129259449] [2024-11-02 12:25:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129259449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864695514] [2024-11-02 12:25:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:20,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:20,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:20,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:20,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:25:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:20,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-02 12:25:20,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-02 12:25:20,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-02 12:25:21,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864695514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:25:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616940378] [2024-11-02 12:25:21,143 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2024-11-02 12:25:21,143 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:25:21,143 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-02 12:25:21,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:25:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-02 12:25:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238103551] [2024-11-02 12:25:21,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:25:21,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-02 12:25:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-02 12:25:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-02 12:25:21,147 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-02 12:25:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:21,445 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2024-11-02 12:25:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-02 12:25:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 69 [2024-11-02 12:25:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:21,448 INFO L225 Difference]: With dead ends: 132 [2024-11-02 12:25:21,448 INFO L226 Difference]: Without dead ends: 82 [2024-11-02 12:25:21,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-02 12:25:21,450 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 26 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:21,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 838 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:25:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-02 12:25:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-02 12:25:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 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) [2024-11-02 12:25:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2024-11-02 12:25:21,464 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 69 [2024-11-02 12:25:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2024-11-02 12:25:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-02 12:25:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2024-11-02 12:25:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-02 12:25:21,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:21,467 INFO L215 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] [2024-11-02 12:25:21,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-02 12:25:21,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:21,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:25:21,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash 982578113, now seen corresponding path program 1 times [2024-11-02 12:25:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859493069] [2024-11-02 12:25:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:25:21,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 12:25:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:25:21,862 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 12:25:21,863 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 12:25:21,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 12:25:21,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:25:21,870 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-02 12:25:21,943 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 12:25:21,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:25:21 BoogieIcfgContainer [2024-11-02 12:25:21,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 12:25:21,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 12:25:21,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 12:25:21,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 12:25:21,948 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:17" (3/4) ... [2024-11-02 12:25:21,953 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-02 12:25:22,026 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 12:25:22,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 12:25:22,027 INFO L158 Benchmark]: Toolchain (without parser) took 5833.64ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 127.5MB in the beginning and 153.3MB in the end (delta: -25.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-02 12:25:22,028 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:25:22,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.66ms. Allocated memory is still 157.3MB. Free memory was 126.8MB in the beginning and 112.8MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-02 12:25:22,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.87ms. Allocated memory is still 157.3MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:25:22,029 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 157.3MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:25:22,029 INFO L158 Benchmark]: RCFGBuilder took 593.19ms. Allocated memory is still 157.3MB. Free memory was 109.4MB in the beginning and 84.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-02 12:25:22,029 INFO L158 Benchmark]: TraceAbstraction took 4720.09ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 83.5MB in the beginning and 157.5MB in the end (delta: -74.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:25:22,033 INFO L158 Benchmark]: Witness Printer took 79.81ms. Allocated memory is still 203.4MB. Free memory was 157.5MB in the beginning and 153.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-02 12:25:22,035 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.29ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.66ms. Allocated memory is still 157.3MB. Free memory was 126.8MB in the beginning and 112.8MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.87ms. Allocated memory is still 157.3MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 157.3MB. Free memory was 111.4MB in the beginning and 109.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 593.19ms. Allocated memory is still 157.3MB. Free memory was 109.4MB in the beginning and 84.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4720.09ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 83.5MB in the beginning and 157.5MB in the end (delta: -74.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 79.81ms. Allocated memory is still 203.4MB. Free memory was 157.5MB in the beginning and 153.3MB 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: [L98] 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}] [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}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-1:0}, n={-1:0}] [L40] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L40] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647] [L41] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-1:0}, \result=2147483647] [L76] RET, EXPR min(t) VAL [t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L72] EXPR t->right VAL [\old(t)={-1:0}] [L72] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-3:0}, i=2] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-3:0}] [L83] EXPR x[0] VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-3:0}] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 2227 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1887 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 340 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=4, InterpolantAutomatonStates: 32, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 6 NumberOfNonLiveVariables, 615 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 156/168 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! [2024-11-02 12:25:22,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff87624d-4687-4768-bb4c-754040b5463b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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