./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh --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 3d10641017a78060218b50f4d70d792898ed2d8ba6a3470f582f96f045a08878 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:46:47,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:46:48,011 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 16:46:48,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:46:48,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:46:48,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:46:48,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:46:48,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:46:48,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:46:48,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:46:48,042 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:46:48,043 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:46:48,043 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:46:48,044 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:46:48,044 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:46:48,045 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:46:48,045 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:46:48,046 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:46:48,046 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:46:48,047 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:46:48,048 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:46:48,048 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:46:48,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:46:48,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 16:46:48,050 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:46:48,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:46:48,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:46:48,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:46:48,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 16:46:48,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:46:48,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 16:46:48,053 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:46:48,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 16:46:48,053 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:46:48,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:46:48,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:46:48,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:46:48,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:46:48,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:46:48,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:46:48,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 16:46:48,055 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:46:48,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:46:48,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:46:48,056 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 16:46:48,056 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:46:48,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:46:48,056 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_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/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_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh 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 -> 3d10641017a78060218b50f4d70d792898ed2d8ba6a3470f582f96f045a08878 [2023-12-02 16:46:48,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:46:48,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:46:48,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:46:48,312 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:46:48,312 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:46:48,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2023-12-02 16:46:51,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:46:51,231 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:46:51,232 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2023-12-02 16:46:51,239 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/data/35595cb7e/930920dc7ee84637ad721ed5f7b46e3a/FLAGfde9c3211 [2023-12-02 16:46:51,250 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/data/35595cb7e/930920dc7ee84637ad721ed5f7b46e3a [2023-12-02 16:46:51,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:46:51,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:46:51,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:46:51,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:46:51,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:46:51,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0fe7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51, skipping insertion in model container [2023-12-02 16:46:51,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,277 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:46:51,390 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c[1113,1126] [2023-12-02 16:46:51,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:46:51,409 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:46:51,417 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c[1113,1126] [2023-12-02 16:46:51,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:46:51,437 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:46:51,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51 WrapperNode [2023-12-02 16:46:51,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:46:51,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:46:51,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:46:51,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:46:51,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,465 INFO L138 Inliner]: procedures = 14, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-12-02 16:46:51,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:46:51,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:46:51,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:46:51,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:46:51,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:46:51,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:46:51,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:46:51,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:46:51,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (1/1) ... [2023-12-02 16:46:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:46:51,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:46:51,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:46:51,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:46:51,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:46:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:46:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 16:46:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 16:46:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:46:51,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:46:51,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 16:46:51,544 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_25_0 [2023-12-02 16:46:51,544 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_25_0 [2023-12-02 16:46:51,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 16:46:51,622 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:46:51,625 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:46:51,763 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:46:51,788 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:46:51,788 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 16:46:51,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:46:51 BoogieIcfgContainer [2023-12-02 16:46:51,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:46:51,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:46:51,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:46:51,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:46:51,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:46:51" (1/3) ... [2023-12-02 16:46:51,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec9596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:46:51, skipping insertion in model container [2023-12-02 16:46:51,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:46:51" (2/3) ... [2023-12-02 16:46:51,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec9596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:46:51, skipping insertion in model container [2023-12-02 16:46:51,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:46:51" (3/3) ... [2023-12-02 16:46:51,800 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_1.c [2023-12-02 16:46:51,821 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:46:51,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 16:46:51,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:46:51,879 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@3ba8d625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:46:51,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 16:46:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 16:46:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 16:46:51,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:46:51,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 16:46:51,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:46:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:46:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1829744450, now seen corresponding path program 1 times [2023-12-02 16:46:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:46:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845344025] [2023-12-02 16:46:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:46:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:46:52,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:46:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845344025] [2023-12-02 16:46:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845344025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:46:52,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:46:52,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 16:46:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685197897] [2023-12-02 16:46:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:46:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 16:46:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:46:52,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 16:46:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 16:46:52,990 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:46:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:46:53,162 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2023-12-02 16:46:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 16:46:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 16:46:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:46:53,171 INFO L225 Difference]: With dead ends: 30 [2023-12-02 16:46:53,171 INFO L226 Difference]: Without dead ends: 12 [2023-12-02 16:46:53,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 16:46:53,178 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:46:53,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:46:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-02 16:46:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-02 16:46:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:46:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-12-02 16:46:53,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2023-12-02 16:46:53,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:46:53,214 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-12-02 16:46:53,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:46:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-12-02 16:46:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 16:46:53,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:46:53,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:46:53,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:46:53,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:46:53,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:46:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1989389024, now seen corresponding path program 1 times [2023-12-02 16:46:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:46:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861362262] [2023-12-02 16:46:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:46:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:46:54,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:46:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861362262] [2023-12-02 16:46:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861362262] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:46:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491804374] [2023-12-02 16:46:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:46:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:46:54,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:46:54,735 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:46:54,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:46:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:46:55,399 WARN L260 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-02 16:46:55,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:46:55,492 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:46:55,494 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 23 treesize of output 19 [2023-12-02 16:46:55,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:55,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:55,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:46:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 35 [2023-12-02 16:46:56,160 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 16:46:56,161 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 5728 treesize of output 4288 [2023-12-02 16:46:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:46:56,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:46:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:46:57,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491804374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:46:57,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255694847] [2023-12-02 16:46:57,638 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 16:46:57,638 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:46:57,642 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 16:46:57,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:46:57,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2023-12-02 16:46:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533559664] [2023-12-02 16:46:57,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:46:57,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 16:46:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:46:57,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 16:46:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-02 16:46:57,647 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:47:00,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:47:03,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:47:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:47:03,748 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-12-02 16:47:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 16:47:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-02 16:47:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:47:03,749 INFO L225 Difference]: With dead ends: 25 [2023-12-02 16:47:03,750 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 16:47:03,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-12-02 16:47:03,751 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 16:47:03,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 16:47:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 16:47:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-12-02 16:47:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:47:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2023-12-02 16:47:03,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 11 [2023-12-02 16:47:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:47:03,757 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2023-12-02 16:47:03,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 14 states have internal predecessors, (24), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:47:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2023-12-02 16:47:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 16:47:03,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:47:03,758 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1] [2023-12-02 16:47:03,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:47:03,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:47:03,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 16:47:03,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:47:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1343745440, now seen corresponding path program 2 times [2023-12-02 16:47:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:47:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076894574] [2023-12-02 16:47:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:47:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:47:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:47:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:47:07,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:47:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076894574] [2023-12-02 16:47:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076894574] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:47:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416199191] [2023-12-02 16:47:07,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 16:47:07,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:47:07,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:47:07,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:47:07,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:47:07,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 16:47:07,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 16:47:07,959 WARN L260 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 178 conjunts are in the unsatisfiable core [2023-12-02 16:47:07,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:47:08,000 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 16:47:08,000 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 23 treesize of output 19 [2023-12-02 16:47:08,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:08,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:08,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:08,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 35 [2023-12-02 16:47:08,846 INFO L349 Elim1Store]: treesize reduction 342, result has 21.0 percent of original size [2023-12-02 16:47:08,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 636 treesize of output 512 [2023-12-02 16:47:09,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:09,428 INFO L224 Elim1Store]: Index analysis took 115 ms [2023-12-02 16:47:09,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 56 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 113 [2023-12-02 16:47:10,651 INFO L349 Elim1Store]: treesize reduction 342, result has 21.0 percent of original size [2023-12-02 16:47:10,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1096 treesize of output 972 [2023-12-02 16:47:10,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 16:47:10,979 INFO L224 Elim1Store]: Index analysis took 164 ms [2023-12-02 16:47:10,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 68 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 258 [2023-12-02 16:47:11,810 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 16:47:11,811 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 3694 treesize of output 2858 [2023-12-02 16:47:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:47:11,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:47:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:47:48,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416199191] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:47:48,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046806664] [2023-12-02 16:47:48,597 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 16:47:48,597 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:47:48,597 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 16:47:48,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:47:48,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2023-12-02 16:47:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123568365] [2023-12-02 16:47:48,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 16:47:48,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 16:47:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:47:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 16:47:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=867, Unknown=6, NotChecked=0, Total=1056 [2023-12-02 16:47:48,601 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 20 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:47:57,256 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:47:59,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:48:14,627 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:48:16,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:48:19,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:48:21,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:48:23,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:48:36,316 WARN L293 SmtUtils]: Spent 11.63s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:48:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:48:39,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:48:49,271 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 209 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:48:52,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:48:54,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:07,152 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:49:10,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:19,653 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:49:22,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:24,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:26,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 16:49:38,577 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:49:50,841 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 16:49:52,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:49:55,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:49:57,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:50:07,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 16:50:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:50:07,104 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-12-02 16:50:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 16:50:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.6) internal successors, (48), 20 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 16:50:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:50:07,110 INFO L225 Difference]: With dead ends: 29 [2023-12-02 16:50:07,110 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 16:50:07,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 130.4s TimeCoverageRelationStatistics Valid=435, Invalid=1803, Unknown=18, NotChecked=0, Total=2256 [2023-12-02 16:50:07,112 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2023-12-02 16:50:07,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 37 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 16 Unknown, 0 Unchecked, 42.6s Time] [2023-12-02 16:50:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 16:50:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 16:50:07,113 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) [2023-12-02 16:50:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 16:50:07,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-12-02 16:50:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:50:07,114 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 16:50:07,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.6) internal successors, (48), 20 states have internal predecessors, (48), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:50:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 16:50:07,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 16:50:07,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 16:50:07,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:50:07,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:50:07,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 16:52:02,467 WARN L293 SmtUtils]: Spent 1.92m on a formula simplification. DAG size of input: 520 DAG size of output: 280 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 16:52:04,933 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 16:52:04,933 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#j~0#1.base|) 0) 0) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#j~0#1.base|)) (= |ULTIMATE.start_main_~#k~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)) (not (= |ULTIMATE.start_main_~#j~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) 0) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#j~0#1.offset| 0) (= |ULTIMATE.start_main_~#i~0#1.offset| 0)) [2023-12-02 16:52:04,933 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-12-02 16:52:04,933 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 16:52:04,933 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2023-12-02 16:52:04,933 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_25_0EXIT(lines 37 52) no Hoare annotation was computed. [2023-12-02 16:52:04,933 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 28) no Hoare annotation was computed. [2023-12-02 16:52:04,934 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 33) no Hoare annotation was computed. [2023-12-02 16:52:04,934 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 20 35) no Hoare annotation was computed. [2023-12-02 16:52:04,936 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse34 (select |#memory_int| |func_to_recursive_line_20_to_25_0_~j#1.base|)) (.cse32 (select |#memory_int| |func_to_recursive_line_20_to_25_0_~k#1.base|)) (.cse33 (select |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base|)) (.cse37 (select |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse35 (select |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~j#1.base|)) (.cse36 (select |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base|))) (let ((.cse20 (select .cse36 0)) (.cse0 (not (= |func_to_recursive_line_20_to_25_0_#in~j#1.offset| 0))) (.cse15 (select .cse35 0)) (.cse10 (not (= |func_to_recursive_line_20_to_25_0_#in~i#1.offset| 0))) (.cse21 (select .cse37 0)) (.cse11 (not (= |func_to_recursive_line_20_to_25_0_#in~k#1.offset| 0))) (.cse5 (= |func_to_recursive_line_20_to_25_0_~j#1.offset| 0)) (.cse4 (select .cse33 0)) (.cse6 (select .cse32 0)) (.cse7 (= |func_to_recursive_line_20_to_25_0_~i#1.offset| 0)) (.cse8 (= |func_to_recursive_line_20_to_25_0_~k#1.offset| 0)) (.cse9 (select .cse34 0)) (.cse1 (= |func_to_recursive_line_20_to_25_0_#in~j#1.base| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse2 (= |func_to_recursive_line_20_to_25_0_#in~i#1.base| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse3 (select .cse37 |func_to_recursive_line_20_to_25_0_#in~k#1.offset|)) (.cse12 (select .cse36 |func_to_recursive_line_20_to_25_0_#in~i#1.offset|)) (.cse13 (select .cse35 |func_to_recursive_line_20_to_25_0_#in~j#1.offset|)) (.cse14 (= |func_to_recursive_line_20_to_25_0_#in~i#1.base| |func_to_recursive_line_20_to_25_0_#in~j#1.base|))) (and (or .cse0 .cse1 .cse2 (not (= .cse3 0)) (and (= .cse4 1) .cse5 (= .cse6 3) .cse7 .cse8 (= .cse9 2)) .cse10 .cse11 (not (= .cse12 0)) (not (= .cse13 0)) .cse14) (or (not (= 2 .cse15)) .cse0 (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse16 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_7) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_8) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_9))) (and (= 2 (select (select .cse16 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0)) (= 7 (select v_DerPreprocessor_9 0)) (= (select (select .cse16 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0) 4)))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse17 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_10) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_11) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_12))) (and (= 2 (select (select .cse17 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0)) (= (select (select .cse17 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0) 4) (= 7 (select v_DerPreprocessor_12 0))))) .cse5 .cse7 (= .cse4 2) (= .cse6 6) (= .cse9 4) .cse8 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse18 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_1) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_2) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_3))) (and (= 2 (select (select .cse18 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0)) (= 4 (select (select .cse18 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0)) (= (select v_DerPreprocessor_3 0) 6)))) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse19 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_13) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_14) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_15))) (and (= (select v_DerPreprocessor_15 0) 5) (= 2 (select (select .cse19 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0)) (= 4 (select (select .cse19 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0)))))) .cse10 .cse11 (not (= .cse20 1)) (not (= 3 .cse21))) (or (not (= 2 .cse20)) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse22 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_13) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_14) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_15))) (or (not (= 2 (select (select .cse22 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))) (not (= (select v_DerPreprocessor_15 0) 5)) (not (= (select (select .cse22 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse23 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_10) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_11) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_12))) (or (not (= (select (select .cse23 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4)) (not (= 7 (select v_DerPreprocessor_12 0))) (not (= (select (select .cse23 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 2))))) .cse0 (not (= 4 .cse15)) (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse24 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_1) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_2) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_3))) (or (not (= (select v_DerPreprocessor_3 0) 6)) (not (= 2 (select (select .cse24 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))) (not (= (select (select .cse24 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse25 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_7) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_8) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_9))) (or (not (= (select (select .cse25 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 2)) (not (= (select (select .cse25 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4)) (not (= 7 (select v_DerPreprocessor_9 0)))))) .cse10 (not (= 6 .cse21)) .cse11 (and .cse5 (= .cse4 3) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse26 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_25) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_26) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_27))) (and (= 6 (select v_DerPreprocessor_27 0)) (= (select (select .cse26 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0) 3) (= (select (select .cse26 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0) 6)))) (= .cse6 9) .cse7 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse27 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_16) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_17) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_18))) (and (= (select v_DerPreprocessor_18 0) 8) (= (select (select .cse27 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0) 3) (= (select (select .cse27 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0) 5)))) .cse8 (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse28 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_~i#1.base| v_DerPreprocessor_19) |func_to_recursive_line_20_to_25_0_~j#1.base| v_DerPreprocessor_20) |func_to_recursive_line_20_to_25_0_~k#1.base| v_DerPreprocessor_21))) (and (= (select (select .cse28 |func_to_recursive_line_20_to_25_0_~i#1.base|) 0) 3) (= (select (select .cse28 |func_to_recursive_line_20_to_25_0_~j#1.base|) 0) 5) (= 9 (select v_DerPreprocessor_21 0))))) (= .cse9 6))) (or (and (not (= |func_to_recursive_line_20_to_25_0_~k#1.base| |func_to_recursive_line_20_to_25_0_~i#1.base|)) (not (= |func_to_recursive_line_20_to_25_0_~j#1.base| |func_to_recursive_line_20_to_25_0_~i#1.base|)) (let ((.cse29 (select .cse34 |func_to_recursive_line_20_to_25_0_~j#1.offset|)) (.cse30 (select .cse33 |func_to_recursive_line_20_to_25_0_~i#1.offset|))) (<= (+ .cse29 .cse30) (let ((.cse31 (select .cse32 |func_to_recursive_line_20_to_25_0_~k#1.offset|))) (+ (* (div (+ .cse29 .cse30 (* (- 1) .cse31)) 4294967296) 4294967296) .cse31)))) (not (= |func_to_recursive_line_20_to_25_0_~j#1.base| |func_to_recursive_line_20_to_25_0_~k#1.base|))) .cse1 .cse2 (< (+ (* (div (+ (* (- 1) .cse3) .cse12 .cse13) 4294967296) 4294967296) .cse3) (+ .cse12 .cse13)) .cse14)))) [2023-12-02 16:52:04,939 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 37 52) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base|)) (.cse17 (select |#memory_int| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse19 (select |#memory_int| |func_to_recursive_line_20_to_25_0_#in~j#1.base|)) (.cse37 (select |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse35 (select |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~j#1.base|)) (.cse36 (select |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base|))) (let ((.cse7 (select .cse36 0)) (.cse0 (select .cse35 0)) (.cse8 (select .cse37 0)) (.cse1 (not (= |func_to_recursive_line_20_to_25_0_#in~j#1.offset| 0))) (.cse4 (select .cse19 0)) (.cse5 (select .cse17 0)) (.cse6 (select .cse18 0)) (.cse9 (= |func_to_recursive_line_20_to_25_0_#in~j#1.base| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse10 (= |func_to_recursive_line_20_to_25_0_#in~i#1.base| |func_to_recursive_line_20_to_25_0_#in~k#1.base|)) (.cse11 (select .cse37 |func_to_recursive_line_20_to_25_0_#in~k#1.offset|)) (.cse2 (not (= |func_to_recursive_line_20_to_25_0_#in~i#1.offset| 0))) (.cse3 (not (= |func_to_recursive_line_20_to_25_0_#in~k#1.offset| 0))) (.cse12 (select .cse36 |func_to_recursive_line_20_to_25_0_#in~i#1.offset|)) (.cse13 (select .cse35 |func_to_recursive_line_20_to_25_0_#in~j#1.offset|)) (.cse20 (= |func_to_recursive_line_20_to_25_0_#in~i#1.base| |func_to_recursive_line_20_to_25_0_#in~j#1.base|))) (and (or (not (= 2 .cse0)) .cse1 .cse2 .cse3 (and (= 2 .cse4) (= 3 .cse5) (= .cse6 1)) (not (= .cse7 1)) (not (= 3 .cse8))) (or .cse9 .cse10 (< (+ (* (div (+ (* (- 1) .cse11) .cse12 .cse13) 4294967296) 4294967296) .cse11) (+ .cse12 .cse13)) (let ((.cse14 (select .cse19 |func_to_recursive_line_20_to_25_0_#in~j#1.offset|)) (.cse15 (select .cse18 |func_to_recursive_line_20_to_25_0_#in~i#1.offset|))) (<= (+ .cse14 .cse15) (let ((.cse16 (select .cse17 |func_to_recursive_line_20_to_25_0_#in~k#1.offset|))) (+ (* (div (+ .cse14 (* (- 1) .cse16) .cse15) 4294967296) 4294967296) .cse16)))) .cse20) (or (not (= 2 .cse7)) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_13) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_14) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_15))) (or (not (= 2 (select (select .cse21 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))) (not (= (select v_DerPreprocessor_15 0) 5)) (not (= (select (select .cse21 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_10) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_11) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_12))) (or (not (= (select (select .cse22 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4)) (not (= 7 (select v_DerPreprocessor_12 0))) (not (= (select (select .cse22 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 2))))) .cse1 (not (= 4 .cse0)) (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse23 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_1) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_2) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_3))) (or (not (= (select v_DerPreprocessor_3 0) 6)) (not (= 2 (select (select .cse23 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))) (not (= (select (select .cse23 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4))))) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse24 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_7) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_8) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_9))) (or (not (= (select (select .cse24 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 2)) (not (= (select (select .cse24 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4)) (not (= 7 (select v_DerPreprocessor_9 0)))))) .cse2 (not (= 6 .cse8)) .cse3 (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse25 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_1) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_2) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_3))) (and (= (select (select .cse25 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4) (= (select v_DerPreprocessor_3 0) 6) (= 2 (select (select .cse25 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse26 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_10) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_11) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_12))) (and (= (select (select .cse26 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4) (= (select (select .cse26 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 2) (= 7 (select v_DerPreprocessor_12 0))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse27 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_7) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_8) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_9))) (and (= 7 (select v_DerPreprocessor_9 0)) (= 2 (select (select .cse27 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0)) (= (select (select .cse27 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4)))) (= 6 .cse5) (= .cse4 4) (= .cse6 2) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse28 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_13) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_14) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_15))) (and (= 2 (select (select .cse28 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0)) (= (select v_DerPreprocessor_15 0) 5) (= (select (select .cse28 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 4)))))) (or (not (= 3 .cse7)) .cse1 (not (= 6 .cse0)) (not (= 9 .cse8)) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse29 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_16) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_17) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_18))) (or (not (= (select v_DerPreprocessor_18 0) 8)) (not (= 3 (select (select .cse29 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))) (not (= 5 (select (select .cse29 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0)))))) .cse2 .cse3 (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse30 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_19) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_20) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_21))) (or (not (= 9 (select v_DerPreprocessor_21 0))) (not (= (select (select .cse30 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 3)) (not (= (select (select .cse30 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 5))))) (and (= 9 .cse5) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse31 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_16) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_17) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_18))) (and (= (select v_DerPreprocessor_18 0) 8) (= 5 (select (select .cse31 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0)) (= 3 (select (select .cse31 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse32 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_19) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_20) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_21))) (and (= 5 (select (select .cse32 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0)) (= (select (select .cse32 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0) 3) (= 9 (select v_DerPreprocessor_21 0))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse33 (store (store (store |#memory_int| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_25) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_26) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_27))) (and (= 6 (select v_DerPreprocessor_27 0)) (= 3 (select (select .cse33 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0)) (= (select (select .cse33 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0) 6)))) (= .cse6 3) (= 6 .cse4)) (forall ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse34 (store (store (store |old(#memory_int)| |func_to_recursive_line_20_to_25_0_#in~i#1.base| v_DerPreprocessor_25) |func_to_recursive_line_20_to_25_0_#in~j#1.base| v_DerPreprocessor_26) |func_to_recursive_line_20_to_25_0_#in~k#1.base| v_DerPreprocessor_27))) (or (not (= 6 (select v_DerPreprocessor_27 0))) (not (= 6 (select (select .cse34 |func_to_recursive_line_20_to_25_0_#in~j#1.base|) 0))) (not (= 3 (select (select .cse34 |func_to_recursive_line_20_to_25_0_#in~i#1.base|) 0))))))) (or .cse1 (and (= .cse4 0) (= .cse5 0) (= .cse6 0)) .cse9 .cse10 (not (= .cse11 0)) .cse2 .cse3 (not (= .cse12 0)) (not (= .cse13 0)) .cse20)))) [2023-12-02 16:52:04,939 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 51) no Hoare annotation was computed. [2023-12-02 16:52:04,939 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 37 52) no Hoare annotation was computed. [2023-12-02 16:52:04,942 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-02 16:52:04,944 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 16:52:04,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:52:04 BoogieIcfgContainer [2023-12-02 16:52:04,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 16:52:04,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 16:52:04,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 16:52:04,949 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 16:52:04,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:46:51" (3/4) ... [2023-12-02 16:52:04,951 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 16:52:04,955 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_25_0 [2023-12-02 16:52:04,958 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-12-02 16:52:04,959 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-12-02 16:52:04,959 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 16:52:04,959 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 16:52:05,024 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 16:52:05,024 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 16:52:05,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 16:52:05,025 INFO L158 Benchmark]: Toolchain (without parser) took 313771.36ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 124.8MB in the beginning and 203.2MB in the end (delta: -78.5MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2023-12-02 16:52:05,025 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 115.3MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:52:05,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.85ms. Allocated memory is still 169.9MB. Free memory was 124.2MB in the beginning and 113.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 16:52:05,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.08ms. Allocated memory is still 169.9MB. Free memory was 113.8MB in the beginning and 112.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:52:05,026 INFO L158 Benchmark]: Boogie Preprocessor took 18.13ms. Allocated memory is still 169.9MB. Free memory was 112.2MB in the beginning and 111.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:52:05,027 INFO L158 Benchmark]: RCFGBuilder took 305.46ms. Allocated memory is still 169.9MB. Free memory was 111.1MB in the beginning and 99.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 16:52:05,027 INFO L158 Benchmark]: TraceAbstraction took 313154.57ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 98.6MB in the beginning and 207.4MB in the end (delta: -108.8MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. [2023-12-02 16:52:05,028 INFO L158 Benchmark]: Witness Printer took 76.25ms. Allocated memory is still 297.8MB. Free memory was 207.4MB in the beginning and 203.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 16:52:05,030 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 115.3MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.85ms. Allocated memory is still 169.9MB. Free memory was 124.2MB in the beginning and 113.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.08ms. Allocated memory is still 169.9MB. Free memory was 113.8MB in the beginning and 112.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.13ms. Allocated memory is still 169.9MB. Free memory was 112.2MB in the beginning and 111.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 305.46ms. Allocated memory is still 169.9MB. Free memory was 111.1MB in the beginning and 99.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 313154.57ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 98.6MB in the beginning and 207.4MB in the end (delta: -108.8MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. * Witness Printer took 76.25ms. Allocated memory is still 297.8MB. Free memory was 207.4MB in the beginning and 203.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: 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 2 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 313.1s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 144.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 117.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 47.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 47.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 20 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 133.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=2, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 15 PreInvPairs, 21 NumberOfFragments, 1704 HoareAnnotationTreeSize, 15 FomulaSimplifications, 3288 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 36866924 FormulaSimplificationTreeSizeReductionInter, 117.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 48.6s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 95 ConstructedInterpolants, 10 QuantifiedInterpolants, 22930776 SizeOfPredicates, 74 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 5/81 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! [2023-12-02 16:52:05,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12f88e99-4bc0-4dca-b80d-ac018c0c95fd/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE