./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje --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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:05:27,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:05:27,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:05:27,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:05:27,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:05:27,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:05:27,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:05:27,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:05:27,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:05:27,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:05:27,684 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:05:27,685 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:05:27,685 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:05:27,686 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:05:27,688 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:05:27,689 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:05:27,689 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:05:27,689 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:05:27,690 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:05:27,690 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:05:27,691 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:05:27,695 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:05:27,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:05:27,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:05:27,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:05:27,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:05:27,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:05:27,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:05:27,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:05:27,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:05:27,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:05:27,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:05:27,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:05:27,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:05:27,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:05:27,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:05:27,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:05:27,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:05:27,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:05:27,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:05:27,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:05:27,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:05:27,710 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:05:27,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:05:27,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:05:27,711 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:05:27,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:05:27,712 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_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/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_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2024-11-09 07:05:28,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:05:28,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:05:28,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:05:28,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:05:28,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:05:28,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c Unable to find full path for "g++" [2024-11-09 07:05:30,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:05:30,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:05:30,904 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-11-09 07:05:30,916 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/data/3ad889899/2747ed5c446e4e318ef0aa30a28f64fb/FLAGa6aa7422a [2024-11-09 07:05:30,945 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/data/3ad889899/2747ed5c446e4e318ef0aa30a28f64fb [2024-11-09 07:05:30,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:05:30,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:05:30,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:30,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:05:30,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:05:30,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:30,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2747a2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:30, skipping insertion in model container [2024-11-09 07:05:30,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:05:30" (1/1) ... [2024-11-09 07:05:31,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:05:31,234 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_162ece40-cbc8-4b43-9fef-f65f1d0bce96/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-11-09 07:05:31,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:31,261 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:05:31,289 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_162ece40-cbc8-4b43-9fef-f65f1d0bce96/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-11-09 07:05:31,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:05:31,316 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:05:31,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31 WrapperNode [2024-11-09 07:05:31,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:05:31,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:31,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:05:31,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:05:31,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,365 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2024-11-09 07:05:31,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:05:31,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:05:31,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:05:31,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:05:31,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:05:31,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:05:31,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:05:31,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:05:31,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (1/1) ... [2024-11-09 07:05:31,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:05:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:31,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:05:31,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:05:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:05:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:05:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:05:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:05:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-11-09 07:05:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-11-09 07:05:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:05:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:05:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:05:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-11-09 07:05:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-11-09 07:05:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:05:31,629 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:05:31,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:05:31,900 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 07:05:31,900 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:05:31,950 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:05:31,950 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:05:31,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:31 BoogieIcfgContainer [2024-11-09 07:05:31,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:05:31,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:05:31,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:05:31,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:05:31,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:05:30" (1/3) ... [2024-11-09 07:05:31,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0499ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:31, skipping insertion in model container [2024-11-09 07:05:31,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:05:31" (2/3) ... [2024-11-09 07:05:31,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0499ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:05:31, skipping insertion in model container [2024-11-09 07:05:31,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:31" (3/3) ... [2024-11-09 07:05:31,967 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-11-09 07:05:31,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:05:31,995 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:05:32,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:05:32,089 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;@362a7178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:05:32,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:05:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:05:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:05:32,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:32,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:32,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1634918771, now seen corresponding path program 1 times [2024-11-09 07:05:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306536107] [2024-11-09 07:05:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:32,876 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-09 07:05:32,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306536107] [2024-11-09 07:05:32,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306536107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:32,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:32,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459607572] [2024-11-09 07:05:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:32,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:32,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:32,917 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:05:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:33,105 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-09 07:05:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-09 07:05:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:33,118 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:05:33,118 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:05:33,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:33,126 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:33,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:05:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:05:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-09 07:05:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:05:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-09 07:05:33,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2024-11-09 07:05:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-09 07:05:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:05:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-09 07:05:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:05:33,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:33,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:33,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:05:33,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:33,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash -268818197, now seen corresponding path program 1 times [2024-11-09 07:05:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384410691] [2024-11-09 07:05:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:05:33,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384410691] [2024-11-09 07:05:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384410691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:33,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:05:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464916645] [2024-11-09 07:05:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:33,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:33,642 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:05:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:33,787 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-09 07:05:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:33,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2024-11-09 07:05:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:33,790 INFO L225 Difference]: With dead ends: 40 [2024-11-09 07:05:33,790 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:05:33,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:33,793 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:33,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:05:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:05:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 07:05:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:05:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 07:05:33,807 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2024-11-09 07:05:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:33,808 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 07:05:33,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:05:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 07:05:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:05:33,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:33,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:33,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:05:33,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 659307019, now seen corresponding path program 1 times [2024-11-09 07:05:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821542019] [2024-11-09 07:05:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:05:34,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821542019] [2024-11-09 07:05:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821542019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878739570] [2024-11-09 07:05:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:34,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:34,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:05:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:34,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:05:34,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:34,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:05:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:05:34,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:05:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878739570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923167059] [2024-11-09 07:05:35,835 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:05:35,835 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:05:35,840 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-09 07:05:35,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2024-11-09 07:05:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422785028] [2024-11-09 07:05:35,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:35,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:05:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:05:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:05:35,847 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.875) internal successors, (30), 18 states have internal predecessors, (30), 7 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-09 07:05:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:36,219 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 07:05:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:05:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.875) internal successors, (30), 18 states have internal predecessors, (30), 7 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2024-11-09 07:05:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:36,222 INFO L225 Difference]: With dead ends: 46 [2024-11-09 07:05:36,222 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 07:05:36,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:05:36,224 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:36,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 85 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:05:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 07:05:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 07:05:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 07:05:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-09 07:05:36,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2024-11-09 07:05:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:36,236 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-09 07:05:36,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.875) internal successors, (30), 18 states have internal predecessors, (30), 7 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-09 07:05:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-09 07:05:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:05:36,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:36,238 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:36,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:05:36,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:36,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:36,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1625699077, now seen corresponding path program 2 times [2024-11-09 07:05:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191930430] [2024-11-09 07:05:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 07:05:37,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191930430] [2024-11-09 07:05:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191930430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148330487] [2024-11-09 07:05:37,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:05:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:37,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:37,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:05:37,497 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 07:05:37,497 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:05:37,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:05:37,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:37,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:05:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:05:37,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:05:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148330487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1483258562] [2024-11-09 07:05:39,991 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:05:39,992 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:05:39,992 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-09 07:05:39,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:39,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 18] total 36 [2024-11-09 07:05:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862623494] [2024-11-09 07:05:39,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:39,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:05:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:05:39,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:05:39,999 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 36 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-09 07:05:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:40,597 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-09 07:05:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:05:40,598 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) Word has length 35 [2024-11-09 07:05:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:40,599 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:05:40,599 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:05:40,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1490, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 07:05:40,601 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:40,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 143 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:05:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:05:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 07:05:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 07:05:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-09 07:05:40,610 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 35 [2024-11-09 07:05:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:40,611 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-09 07:05:40,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 31 states have internal predecessors, (44), 12 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-09 07:05:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-09 07:05:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:05:40,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:40,613 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:40,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:05:40,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:40,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash 167978987, now seen corresponding path program 3 times [2024-11-09 07:05:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347589589] [2024-11-09 07:05:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 07:05:42,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347589589] [2024-11-09 07:05:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347589589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35472279] [2024-11-09 07:05:42,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:05:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:42,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:42,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:05:42,198 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:05:42,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:05:42,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-09 07:05:42,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:05:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 07:05:42,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:05:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35472279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [245699471] [2024-11-09 07:05:45,927 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:05:45,927 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:05:45,927 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-09 07:05:45,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:45,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 43 [2024-11-09 07:05:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738135886] [2024-11-09 07:05:45,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 07:05:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:45,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 07:05:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 07:05:45,932 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (13), 9 states have call predecessors, (13), 15 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-09 07:05:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:46,485 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-09 07:05:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:05:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (13), 9 states have call predecessors, (13), 15 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) Word has length 45 [2024-11-09 07:05:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:46,487 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:05:46,487 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:05:46,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=485, Invalid=1965, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:05:46,489 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:46,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 192 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:05:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:05:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 07:05:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 07:05:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-09 07:05:46,499 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2024-11-09 07:05:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:46,499 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-09 07:05:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (13), 9 states have call predecessors, (13), 15 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-09 07:05:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-09 07:05:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:05:46,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:46,501 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:46,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:05:46,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:46,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:46,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1170219963, now seen corresponding path program 4 times [2024-11-09 07:05:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943517072] [2024-11-09 07:05:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 07:05:52,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943517072] [2024-11-09 07:05:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943517072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870539418] [2024-11-09 07:05:52,609 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 07:05:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:52,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:52,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:05:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:52,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 07:05:52,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:52,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:05:52,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:05:55,109 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from false [2024-11-09 07:05:57,111 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from true [2024-11-09 07:05:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 72 trivial. 6 not checked. [2024-11-09 07:05:57,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:57,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 5)) is different from false [2024-11-09 07:05:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870539418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222802088] [2024-11-09 07:05:57,965 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:05:57,965 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:05:57,966 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-09 07:05:57,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:05:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 19 [2024-11-09 07:05:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628543875] [2024-11-09 07:05:57,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:05:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:57,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:05:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=277, Unknown=3, NotChecked=70, Total=420 [2024-11-09 07:05:57,970 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 16 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 07:06:00,113 WARN L851 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base)) is different from false [2024-11-09 07:06:02,115 WARN L873 $PredicateComparison]: unable to prove that (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base)) is different from true [2024-11-09 07:06:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:06:02,278 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-09 07:06:02,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:06:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 16 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2024-11-09 07:06:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:06:02,280 INFO L225 Difference]: With dead ends: 38 [2024-11-09 07:06:02,280 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:06:02,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=102, Invalid=367, Unknown=5, NotChecked=126, Total=600 [2024-11-09 07:06:02,282 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:06:02,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 60 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 2 Unknown, 42 Unchecked, 0.2s Time] [2024-11-09 07:06:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:06:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 07:06:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 07:06:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-09 07:06:02,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 50 [2024-11-09 07:06:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:02,295 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-09 07:06:02,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 16 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 07:06:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-09 07:06:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 07:06:02,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:06:02,298 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:02,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:02,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:02,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:06:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2066322437, now seen corresponding path program 5 times [2024-11-09 07:06:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:06:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016871615] [2024-11-09 07:06:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-11-09 07:06:11,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:06:11,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016871615] [2024-11-09 07:06:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016871615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284875105] [2024-11-09 07:06:11,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:06:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:11,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:06:11,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:11,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:06:11,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-09 07:06:11,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:06:11,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-09 07:06:11,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:11,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:06:11,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:06:13,113 INFO L349 Elim1Store]: treesize reduction 34, result has 47.7 percent of original size [2024-11-09 07:06:13,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 87 [2024-11-09 07:06:13,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:06:13,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2024-11-09 07:06:13,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:06:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 236 proven. 58 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-09 07:06:13,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:15,281 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-11-09 07:06:15,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 57 [2024-11-09 07:06:15,301 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:06:15,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2024-11-09 07:06:15,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-09 07:06:18,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base|) |c_func_to_recursive_line_20_to_21_0_#in~b.offset| 6)))) (let ((.cse4 (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (let ((.cse2 (select .cse4 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|))) (let ((.cse0 (and (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| Int)) (= 6 (select (select |c_#memory_int| |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|))) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7| Int)) (= 6 (select (select |c_#memory_int| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|))))) (.cse1 (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (store .cse4 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ .cse2 1))))) (and (or (< (select (select |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~a.base|) |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 6) .cse0) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7| Int)) (or (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| Int)) (or (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|))) (= 6 (select (select |c_#memory_int| |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|)))) (= |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7| Int)) (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|)))))) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7| Int)) (or (= |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7| Int)) (or (= 6 (select (select |c_#memory_int| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|)) (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|))))) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| Int)) (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|)))))) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| Int)) (or (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7| Int)) (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|)))) (= |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| Int)) (or (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|))) (= 6 (select (select |c_#memory_int| |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|)))))) (or (< 4 .cse2) .cse0) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| Int)) (or (forall ((|v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6| Int)) (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~b.offset_BEFORE_CALL_6|)))) (forall ((|v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7| Int)) (or (= 6 (select (select |c_#memory_int| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|)) (not (= 6 (select (select .cse1 |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|) |v_func_to_recursive_line_20_to_21_0_#in~a.offset_BEFORE_CALL_7|))))) (= |v_func_to_recursive_line_20_to_21_0_#in~b.base_BEFORE_CALL_7| |v_func_to_recursive_line_20_to_21_0_#in~a.base_BEFORE_CALL_7|)))))))) is different from false [2024-11-09 07:06:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284875105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1154474938] [2024-11-09 07:06:19,464 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:06:19,464 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:06:19,465 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-09 07:06:19,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:06:19,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 38 [2024-11-09 07:06:19,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651437104] [2024-11-09 07:06:19,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:19,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:06:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:06:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:06:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1646, Unknown=2, NotChecked=82, Total=1892 [2024-11-09 07:06:19,470 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 38 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 34 states have internal predecessors, (47), 11 states have call successors, (12), 2 states have call predecessors, (12), 15 states have return successors, (19), 18 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-09 07:06:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:06:21,405 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-11-09 07:06:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:06:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 34 states have internal predecessors, (47), 11 states have call successors, (12), 2 states have call predecessors, (12), 15 states have return successors, (19), 18 states have call predecessors, (19), 11 states have call successors, (19) Word has length 91 [2024-11-09 07:06:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:06:21,408 INFO L225 Difference]: With dead ends: 48 [2024-11-09 07:06:21,408 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:06:21,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=334, Invalid=3449, Unknown=3, NotChecked=120, Total=3906 [2024-11-09 07:06:21,411 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:06:21,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 273 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 560 Invalid, 2 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:06:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:06:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-11-09 07:06:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 07:06:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-09 07:06:21,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 91 [2024-11-09 07:06:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:21,428 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-09 07:06:21,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 34 states have internal predecessors, (47), 11 states have call successors, (12), 2 states have call predecessors, (12), 15 states have return successors, (19), 18 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-09 07:06:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 07:06:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 07:06:21,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:06:21,431 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:21,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:06:21,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:21,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:06:21,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash -4769101, now seen corresponding path program 6 times [2024-11-09 07:06:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:06:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443152283] [2024-11-09 07:06:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 56 proven. 127 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-11-09 07:06:31,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:06:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443152283] [2024-11-09 07:06:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443152283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230370440] [2024-11-09 07:06:31,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:06:31,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:06:31,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:31,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:06:32,222 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:06:32,222 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:06:32,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 248 conjuncts are in the unsatisfiable core [2024-11-09 07:06:32,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:32,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:06:32,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 07:06:32,955 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-11-09 07:06:32,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2024-11-09 07:06:33,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:06:33,957 INFO L349 Elim1Store]: treesize reduction 34, result has 47.7 percent of original size [2024-11-09 07:06:33,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 87 [2024-11-09 07:06:34,002 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:06:34,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2024-11-09 07:06:34,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:06:34,239 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:06:34,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-09 07:06:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 246 proven. 440 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-09 07:06:34,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:37,457 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-09 07:06:37,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 652 treesize of output 661 [2024-11-09 07:06:37,546 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-09 07:06:37,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 599 treesize of output 580 [2024-11-09 07:06:37,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:37,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 469 [2024-11-09 07:06:37,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:37,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 494 treesize of output 482 [2024-11-09 07:06:38,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:06:41,432 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-11-09 07:06:41,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 447 treesize of output 451 [2024-11-09 07:06:41,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:41,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-09 07:06:41,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:06:41,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 423 treesize of output 431 [2024-11-09 07:06:45,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230370440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [724935848] [2024-11-09 07:06:45,533 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:06:45,533 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:06:45,534 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-09 07:06:45,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:06:45,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 43 [2024-11-09 07:06:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222977631] [2024-11-09 07:06:45,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:45,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 07:06:45,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:06:45,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 07:06:45,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2074, Unknown=3, NotChecked=0, Total=2256 [2024-11-09 07:06:45,538 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 38 states have internal predecessors, (50), 13 states have call successors, (15), 2 states have call predecessors, (15), 16 states have return successors, (23), 22 states have call predecessors, (23), 13 states have call successors, (23) [2024-11-09 07:06:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:06:48,386 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2024-11-09 07:06:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 07:06:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 38 states have internal predecessors, (50), 13 states have call successors, (15), 2 states have call predecessors, (15), 16 states have return successors, (23), 22 states have call predecessors, (23), 13 states have call successors, (23) Word has length 132 [2024-11-09 07:06:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:06:48,389 INFO L225 Difference]: With dead ends: 66 [2024-11-09 07:06:48,389 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:06:48,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 192 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=458, Invalid=4507, Unknown=5, NotChecked=0, Total=4970 [2024-11-09 07:06:48,396 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 61 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 96 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:06:48,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 330 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 597 Invalid, 14 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:06:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:06:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2024-11-09 07:06:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 29 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 17 states have return successors, (29), 18 states have call predecessors, (29), 5 states have call successors, (29) [2024-11-09 07:06:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-09 07:06:48,431 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 132 [2024-11-09 07:06:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:48,432 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-09 07:06:48,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 38 states have internal predecessors, (50), 13 states have call successors, (15), 2 states have call predecessors, (15), 16 states have return successors, (23), 22 states have call predecessors, (23), 13 states have call successors, (23) [2024-11-09 07:06:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-09 07:06:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 07:06:48,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:06:48,436 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 25, 25, 25, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:48,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:06:48,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:48,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:06:48,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash -557513343, now seen corresponding path program 7 times [2024-11-09 07:06:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:06:48,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605538589] [2024-11-09 07:06:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 308 proven. 514 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2024-11-09 07:06:50,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:06:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605538589] [2024-11-09 07:06:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605538589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:06:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149894915] [2024-11-09 07:06:50,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 07:06:50,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:06:50,920 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:06:50,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:06:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:06:51,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 07:06:51,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:06:51,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:06:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1313 proven. 26 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-09 07:06:51,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:06:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 309 proven. 559 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2024-11-09 07:06:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149894915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:06:55,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [730000919] [2024-11-09 07:06:55,735 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 07:06:55,735 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:06:55,735 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-09 07:06:55,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:06:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 30] total 41 [2024-11-09 07:06:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63463610] [2024-11-09 07:06:55,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:06:55,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 07:06:55,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:06:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 07:06:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:06:55,741 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 41 states, 29 states have (on average 1.896551724137931) internal successors, (55), 33 states have internal predecessors, (55), 15 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (32), 10 states have call predecessors, (32), 15 states have call successors, (32) [2024-11-09 07:06:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:06:56,858 INFO L93 Difference]: Finished difference Result 101 states and 171 transitions. [2024-11-09 07:06:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 07:06:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 29 states have (on average 1.896551724137931) internal successors, (55), 33 states have internal predecessors, (55), 15 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (32), 10 states have call predecessors, (32), 15 states have call successors, (32) Word has length 178 [2024-11-09 07:06:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:06:56,860 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:06:56,860 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:06:56,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 339 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1070, Invalid=3486, Unknown=0, NotChecked=0, Total=4556 [2024-11-09 07:06:56,864 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 79 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:06:56,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 141 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:06:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:06:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:06:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:06:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:06:56,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2024-11-09 07:06:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:06:56,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 29 states have (on average 1.896551724137931) internal successors, (55), 33 states have internal predecessors, (55), 15 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (32), 10 states have call predecessors, (32), 15 states have call successors, (32) [2024-11-09 07:06:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:06:56,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:06:56,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 07:06:56,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:06:57,079 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-11-09 07:06:57,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 07:06:59,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:06:59,453 WARN L162 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_21_0 contained old-variable. Original clause: (= |#memory_int| |old(#memory_int)|) Eliminated clause: true [2024-11-09 07:06:59,468 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!base [2024-11-09 07:06:59,469 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~b!base [2024-11-09 07:06:59,470 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!offset [2024-11-09 07:06:59,471 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~b!offset [2024-11-09 07:06:59,471 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,471 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,471 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-09 07:06:59,473 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,473 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,473 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-09 07:06:59,474 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,474 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,474 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,474 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,474 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-09 07:06:59,475 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,475 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,475 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,475 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:06:59,475 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,476 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,476 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-09 07:06:59,476 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,476 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,476 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-09 07:06:59,479 WARN L162 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_21_0 contained old-variable. Original clause: (= |#memory_int| |old(#memory_int)|) Eliminated clause: true [2024-11-09 07:06:59,494 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,496 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:06:59,496 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,496 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,496 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,498 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,499 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,499 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,499 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,499 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:06:59,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,500 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:06:59,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,501 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,502 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:06:59,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,504 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,505 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,506 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 07:06:59,506 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,506 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,506 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,506 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] [2024-11-09 07:06:59,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-09 07:06:59,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 07:06:59,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-09 07:06:59,508 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-09 07:06:59,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:06:59 BoogieIcfgContainer [2024-11-09 07:06:59,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:06:59,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:06:59,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:06:59,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:06:59,510 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:05:31" (3/4) ... [2024-11-09 07:06:59,513 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:06:59,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-11-09 07:06:59,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-11-09 07:06:59,524 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 07:06:59,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 07:06:59,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:06:59,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:06:59,636 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 07:06:59,637 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/witness.yml [2024-11-09 07:06:59,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:06:59,638 INFO L158 Benchmark]: Toolchain (without parser) took 88687.43ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 120.1MB in the beginning and 734.4MB in the end (delta: -614.4MB). Peak memory consumption was 390.5MB. Max. memory is 16.1GB. [2024-11-09 07:06:59,638 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 104.9MB. Free memory is still 52.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:06:59,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.75ms. Allocated memory is still 151.0MB. Free memory was 119.6MB in the beginning and 107.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:06:59,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.15ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:06:59,639 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 105.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:06:59,640 INFO L158 Benchmark]: RCFGBuilder took 539.19ms. Allocated memory is still 151.0MB. Free memory was 105.0MB in the beginning and 92.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:06:59,640 INFO L158 Benchmark]: TraceAbstraction took 87551.79ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 91.7MB in the beginning and 738.6MB in the end (delta: -647.0MB). Peak memory consumption was 356.9MB. Max. memory is 16.1GB. [2024-11-09 07:06:59,641 INFO L158 Benchmark]: Witness Printer took 127.93ms. Allocated memory is still 1.2GB. Free memory was 738.6MB in the beginning and 734.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:06:59,642 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.36ms. Allocated memory is still 104.9MB. Free memory is still 52.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.75ms. Allocated memory is still 151.0MB. Free memory was 119.6MB in the beginning and 107.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.15ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 105.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.19ms. Allocated memory is still 151.0MB. Free memory was 105.0MB in the beginning and 92.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 87551.79ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 91.7MB in the beginning and 738.6MB in the end (delta: -647.0MB). Peak memory consumption was 356.9MB. Max. memory is 16.1GB. * Witness Printer took 127.93ms. Allocated memory is still 1.2GB. Free memory was 738.6MB in the beginning and 734.4MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~b!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~a!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~b!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression * 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 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 85.0s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 1309 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 42 IncrementalHoareTripleChecker+Unchecked, 1176 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2512 IncrementalHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 133 mSDtfsCounter, 2512 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 882 SyntacticMatches, 24 SemanticMatches, 342 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5640 ImplicationChecksByTransitivity, 21.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=8, InterpolantAutomatonStates: 153, 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, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 68.9s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1404 ConstructedInterpolants, 12 QuantifiedInterpolants, 10774 SizeOfPredicates, 138 NumberOfNonLiveVariables, 2357 ConjunctsInSsa, 718 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 7388/9437 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:06:59,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_162ece40-cbc8-4b43-9fef-f65f1d0bce96/bin/utaipan-verify-YMUCfTKeje/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 Result: TRUE