./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:33:33,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:33:33,476 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:33:33,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:33:33,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:33:33,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:33:33,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:33:33,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:33:33,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:33:33,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:33:33,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:33:33,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:33:33,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:33:33,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:33:33,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:33:33,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:33:33,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:33:33,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:33:33,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:33:33,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:33:33,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:33:33,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:33:33,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:33:33,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:33:33,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:33:33,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:33:33,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:33:33,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:33:33,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:33:33,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:33:33,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:33:33,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:33:33,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:33:33,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:33:33,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:33:33,519 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd 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 -> 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2024-11-13 14:33:33,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:33:33,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:33:33,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:33:33,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:33:33,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:33:33,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/verifythis/tree_del_iter.c Unable to find full path for "g++" [2024-11-13 14:33:36,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:33:36,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:33:36,908 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/sv-benchmarks/c/verifythis/tree_del_iter.c [2024-11-13 14:33:36,921 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/data/8c91ea2d9/12361c0d02d04ed59f1c2bf77fec5db7/FLAG68fb40e24 [2024-11-13 14:33:37,100 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/data/8c91ea2d9/12361c0d02d04ed59f1c2bf77fec5db7 [2024-11-13 14:33:37,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:33:37,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:33:37,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:33:37,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:33:37,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:33:37,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f35257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37, skipping insertion in model container [2024-11-13 14:33:37,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:33:37,337 WARN L250 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_9959e555-8358-4c94-af7f-f7a47595e458/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2024-11-13 14:33:37,364 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-13 14:33:37,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:33:37,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:33:37,412 WARN L250 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_9959e555-8358-4c94-af7f-f7a47595e458/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2024-11-13 14:33:37,433 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-13 14:33:37,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:33:37,479 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:33:37,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37 WrapperNode [2024-11-13 14:33:37,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:33:37,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:33:37,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:33:37,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:33:37,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,529 INFO L138 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-11-13 14:33:37,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:33:37,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:33:37,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:33:37,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:33:37,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,589 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 5, 19, 2]. 68 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 2, 4, 1]. [2024-11-13 14:33:37,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:33:37,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:33:37,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:33:37,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:33:37,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (1/1) ... [2024-11-13 14:33:37,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:33:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:33:37,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:33:37,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:33:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:33:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 14:33:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 14:33:37,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-13 14:33:37,724 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-13 14:33:37,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-13 14:33:37,725 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 14:33:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-13 14:33:37,728 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-13 14:33:37,729 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-13 14:33:37,729 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-13 14:33:37,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:33:37,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:33:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 14:33:37,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 14:33:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-13 14:33:37,730 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-13 14:33:37,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 14:33:37,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:33:37,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:33:38,271 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-13 14:33:38,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:33:38,287 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:33:38,287 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 14:33:38,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:38 BoogieIcfgContainer [2024-11-13 14:33:38,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:33:38,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:33:38,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:33:38,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:33:38,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:33:37" (1/3) ... [2024-11-13 14:33:38,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607e5e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:33:38, skipping insertion in model container [2024-11-13 14:33:38,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:33:37" (2/3) ... [2024-11-13 14:33:38,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607e5e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:33:38, skipping insertion in model container [2024-11-13 14:33:38,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:38" (3/3) ... [2024-11-13 14:33:38,302 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2024-11-13 14:33:38,319 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:33:38,321 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_del_iter.c that has 7 procedures, 83 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-13 14:33:38,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:33:38,390 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=PETRI_NET, 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;@45bbb9f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:33:38,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:33:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:33:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 14:33:38,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:33:38,406 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, 1, 1, 1, 1] [2024-11-13 14:33:38,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:33:38,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1532996859, now seen corresponding path program 1 times [2024-11-13 14:33:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:38,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340500] [2024-11-13 14:33:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:33:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 14:33:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:33:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:39,171 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-13 14:33:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340500] [2024-11-13 14:33:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:39,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:33:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090953292] [2024-11-13 14:33:39,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:39,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:33:39,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:33:39,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:33:39,203 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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) [2024-11-13 14:33:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:33:39,936 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2024-11-13 14:33:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:33:39,939 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 [2024-11-13 14:33:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:33:39,949 INFO L225 Difference]: With dead ends: 147 [2024-11-13 14:33:39,949 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 14:33:39,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:33:39,959 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 104 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:33:39,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 215 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:33:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 14:33:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2024-11-13 14:33:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-13 14:33:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2024-11-13 14:33:40,036 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 37 [2024-11-13 14:33:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:33:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2024-11-13 14:33:40,037 INFO L472 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) [2024-11-13 14:33:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2024-11-13 14:33:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 14:33:40,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:33:40,044 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, 1, 1, 1, 1] [2024-11-13 14:33:40,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:33:40,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:33:40,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash -575613588, now seen corresponding path program 1 times [2024-11-13 14:33:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569390133] [2024-11-13 14:33:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 14:33:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 14:33:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:33:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:40,889 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-13 14:33:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569390133] [2024-11-13 14:33:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569390133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:33:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304385396] [2024-11-13 14:33:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:33:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:33:40,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:33:40,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:33:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:41,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 14:33:41,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:33:41,293 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-13 14:33:41,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:33:41,683 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-13 14:33:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304385396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:33:41,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:33:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-13 14:33:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219451602] [2024-11-13 14:33:41,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:33:41,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:33:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:33:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:33:41,689 INFO L87 Difference]: Start difference. First operand 79 states and 103 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) [2024-11-13 14:33:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:33:42,758 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2024-11-13 14:33:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:33:42,760 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 [2024-11-13 14:33:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:33:42,762 INFO L225 Difference]: With dead ends: 142 [2024-11-13 14:33:42,762 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 14:33:42,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:33:42,765 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 102 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:33:42,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 217 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:33:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 14:33:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-11-13 14:33:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-13 14:33:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-13 14:33:42,791 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 49 [2024-11-13 14:33:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:33:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-13 14:33:42,792 INFO L472 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) [2024-11-13 14:33:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-13 14:33:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 14:33:42,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:33:42,795 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, 1, 1, 1, 1] [2024-11-13 14:33:42,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 14:33:42,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:33:42,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:33:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1330694331, now seen corresponding path program 1 times [2024-11-13 14:33:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659433874] [2024-11-13 14:33:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:33:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 14:33:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 14:33:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 14:33:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:43,579 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-13 14:33:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659433874] [2024-11-13 14:33:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659433874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:33:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:33:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:33:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915207631] [2024-11-13 14:33:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:33:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:33:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:33:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:33:43,583 INFO L87 Difference]: Start difference. First operand 81 states and 106 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) [2024-11-13 14:33:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:33:44,384 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2024-11-13 14:33:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:33:44,385 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 [2024-11-13 14:33:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:33:44,388 INFO L225 Difference]: With dead ends: 142 [2024-11-13 14:33:44,388 INFO L226 Difference]: Without dead ends: 86 [2024-11-13 14:33:44,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:33:44,389 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 124 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:33:44,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 261 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:33:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-13 14:33:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-13 14:33:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-11-13 14:33:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2024-11-13 14:33:44,421 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2024-11-13 14:33:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:33:44,422 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2024-11-13 14:33:44,422 INFO L472 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) [2024-11-13 14:33:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2024-11-13 14:33:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 14:33:44,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:33:44,428 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, 1, 1, 1, 1, 1] [2024-11-13 14:33:44,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:33:44,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:33:44,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash -996697255, now seen corresponding path program 1 times [2024-11-13 14:33:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922973531] [2024-11-13 14:33:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:44,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:44,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:44,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:33:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 14:33:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 14:33:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-13 14:33:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:33:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-13 14:33:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,167 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-13 14:33:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:33:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922973531] [2024-11-13 14:33:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922973531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:33:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762519611] [2024-11-13 14:33:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:33:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:33:45,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:33:45,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:33:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:45,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 14:33:45,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:33:45,536 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-13 14:33:45,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:33:45,835 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-13 14:33:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762519611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:33:45,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:33:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 19 [2024-11-13 14:33:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183350745] [2024-11-13 14:33:45,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:33:45,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:33:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:33:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:33:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:33:45,838 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-13 14:33:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:33:47,285 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2024-11-13 14:33:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:33:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) Word has length 74 [2024-11-13 14:33:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:33:47,289 INFO L225 Difference]: With dead ends: 136 [2024-11-13 14:33:47,289 INFO L226 Difference]: Without dead ends: 88 [2024-11-13 14:33:47,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:33:47,293 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 115 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:33:47,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 451 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 14:33:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-13 14:33:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-13 14:33:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (29), 20 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-13 14:33:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2024-11-13 14:33:47,325 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 74 [2024-11-13 14:33:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:33:47,325 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2024-11-13 14:33:47,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-13 14:33:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2024-11-13 14:33:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 14:33:47,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:33:47,332 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, 1, 1, 1, 1, 1] [2024-11-13 14:33:47,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:33:47,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:33:47,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:33:47,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:33:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1400391972, now seen corresponding path program 1 times [2024-11-13 14:33:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:33:47,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39019469] [2024-11-13 14:33:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:33:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:33:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:33:47,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:33:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:33:47,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:33:47,720 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:33:47,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:33:47,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:33:47,727 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-13 14:33:47,802 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:33:47,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:33:47 BoogieIcfgContainer [2024-11-13 14:33:47,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:33:47,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:33:47,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:33:47,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:33:47,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:33:38" (3/4) ... [2024-11-13 14:33:47,809 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 14:33:47,896 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:33:47,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:33:47,897 INFO L158 Benchmark]: Toolchain (without parser) took 10793.49ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 116.8MB in the beginning and 95.1MB in the end (delta: 21.6MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-11-13 14:33:47,899 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:47,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.17ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 103.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:33:47,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.67ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:33:47,901 INFO L158 Benchmark]: Boogie Preprocessor took 102.22ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 99.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:33:47,902 INFO L158 Benchmark]: RCFGBuilder took 653.71ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 76.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:33:47,903 INFO L158 Benchmark]: TraceAbstraction took 9513.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 75.5MB in the beginning and 98.4MB in the end (delta: -22.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-13 14:33:47,903 INFO L158 Benchmark]: Witness Printer took 89.19ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 95.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:33:47,905 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.45ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.17ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 103.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.67ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.22ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 99.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 653.71ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 76.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9513.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 75.5MB in the beginning and 98.4MB in the end (delta: -22.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Witness Printer took 89.19ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 95.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. 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: [L110] 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}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L42] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\old(n)={-1:0}, \result=2147483647] [L86] RET, EXPR min(t) VAL [t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [\old(t)={-1:0}] [L82] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L93] EXPR x[0] [L93] 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 7 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 1144 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 957 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2132 IncrementalHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 187 mSDtfsCounter, 2132 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=4, InterpolantAutomatonStates: 48, 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 6 NumberOfNonLiveVariables, 634 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-13 14:33:47,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9959e555-8358-4c94-af7f-f7a47595e458/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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