./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 30e01a73 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_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/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_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire --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.3-dev-30e01a7 [2023-11-23 21:20:44,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:20:44,498 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 21:20:44,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:20:44,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:20:44,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:20:44,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:20:44,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:20:44,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:20:44,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:20:44,538 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:20:44,538 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:20:44,539 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:20:44,540 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:20:44,540 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:20:44,541 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:20:44,542 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:20:44,542 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:20:44,543 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:20:44,544 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:20:44,545 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:20:44,545 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:20:44,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:20:44,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:20:44,548 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:20:44,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:20:44,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:20:44,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:20:44,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:20:44,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:20:44,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:20:44,552 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:20:44,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:20:44,553 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:20:44,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:20:44,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:20:44,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:20:44,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:20:44,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:20:44,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:20:44,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:20:44,569 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:20:44,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:20:44,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:20:44,570 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:20:44,571 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:20:44,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:20:44,571 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_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/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_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire 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-11-23 21:20:44,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:20:44,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:20:44,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:20:44,888 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:20:44,889 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:20:44,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2023-11-23 21:20:47,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:20:48,206 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:20:48,207 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2023-11-23 21:20:48,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/data/44d4fc4a8/d02fcd9c4a594de9894a6b3401a77f5e/FLAG473def8b4 [2023-11-23 21:20:48,234 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/data/44d4fc4a8/d02fcd9c4a594de9894a6b3401a77f5e [2023-11-23 21:20:48,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:20:48,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:20:48,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:20:48,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:20:48,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:20:48,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0e3a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48, skipping insertion in model container [2023-11-23 21:20:48,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,305 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:20:48,480 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_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c[1113,1126] [2023-11-23 21:20:48,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:20:48,505 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:20:48,518 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_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c[1113,1126] [2023-11-23 21:20:48,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:20:48,540 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:20:48,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48 WrapperNode [2023-11-23 21:20:48,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:20:48,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:20:48,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:20:48,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:20:48,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,574 INFO L138 Inliner]: procedures = 14, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-11-23 21:20:48,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:20:48,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:20:48,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:20:48,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:20:48,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:20:48,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:20:48,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:20:48,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:20:48,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (1/1) ... [2023-11-23 21:20:48,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:20:48,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:20:48,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:20:48,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:20:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:20:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:20:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:20:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:20:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:20:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:20:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:20:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_25_0 [2023-11-23 21:20:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_25_0 [2023-11-23 21:20:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:20:48,835 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:20:48,837 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:20:49,112 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:20:49,154 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:20:49,162 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:20:49,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:49 BoogieIcfgContainer [2023-11-23 21:20:49,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:20:49,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:20:49,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:20:49,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:20:49,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:20:48" (1/3) ... [2023-11-23 21:20:49,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1e43a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:49, skipping insertion in model container [2023-11-23 21:20:49,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:48" (2/3) ... [2023-11-23 21:20:49,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1e43a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:49, skipping insertion in model container [2023-11-23 21:20:49,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:49" (3/3) ... [2023-11-23 21:20:49,180 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_1.c [2023-11-23 21:20:49,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:20:49,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:20:49,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:20:49,279 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;@cbe5c0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:20:49,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:20:49,284 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-11-23 21:20:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-23 21:20:49,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:49,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-23 21:20:49,295 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-11-23 21:20:49,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1829744450, now seen corresponding path program 1 times [2023-11-23 21:20:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513096864] [2023-11-23 21:20:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:50,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513096864] [2023-11-23 21:20:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513096864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:20:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:20:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:20:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100502529] [2023-11-23 21:20:50,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:20:50,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:20:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:20:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:20:50,861 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-11-23 21:20:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:20:51,008 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2023-11-23 21:20:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:20:51,011 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-11-23 21:20:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:20:51,017 INFO L225 Difference]: With dead ends: 30 [2023-11-23 21:20:51,017 INFO L226 Difference]: Without dead ends: 12 [2023-11-23 21:20:51,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:20:51,024 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-11-23 21:20:51,025 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-11-23 21:20:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-23 21:20:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-23 21:20:51,054 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-11-23 21:20:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-11-23 21:20:51,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2023-11-23 21:20:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:20:51,057 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-11-23 21:20:51,058 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-11-23 21:20:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-11-23 21:20:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 21:20:51,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:51,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:20:51,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:20:51,059 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-11-23 21:20:51,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1989389024, now seen corresponding path program 1 times [2023-11-23 21:20:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762463120] [2023-11-23 21:20:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:52,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:20:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762463120] [2023-11-23 21:20:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762463120] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:20:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685444867] [2023-11-23 21:20:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:52,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:20:52,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:20:52,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:20:52,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:20:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:20:53,190 WARN L260 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-23 21:20:53,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:20:53,282 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 21:20:53,283 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-11-23 21:20:53,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:53,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:53,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:20:53,632 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-11-23 21:20:53,988 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-23 21:20:53,990 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-11-23 21:20:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:54,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:20:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:20:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685444867] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:20:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848449168] [2023-11-23 21:20:55,503 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-11-23 21:20:55,503 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:20:55,509 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-11-23 21:20:55,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:20:55,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2023-11-23 21:20:55,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55527849] [2023-11-23 21:20:55,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:20:55,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 21:20:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:20:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 21:20:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-11-23 21:20:55,521 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-11-23 21:20:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:20:57,536 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-11-23 21:20:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 21:20:57,537 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-11-23 21:20:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:20:57,538 INFO L225 Difference]: With dead ends: 25 [2023-11-23 21:20:57,538 INFO L226 Difference]: Without dead ends: 23 [2023-11-23 21:20:57,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-11-23 21:20:57,540 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:20:57,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 21:20:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-23 21:20:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-11-23 21:20:57,549 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-11-23 21:20:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2023-11-23 21:20:57,550 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 11 [2023-11-23 21:20:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:20:57,551 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2023-11-23 21:20:57,551 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-11-23 21:20:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2023-11-23 21:20:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 21:20:57,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:20:57,553 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1] [2023-11-23 21:20:57,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 21:20:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:20:57,775 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-11-23 21:20:57,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:20:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1343745440, now seen corresponding path program 2 times [2023-11-23 21:20:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:20:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366893858] [2023-11-23 21:20:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:20:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:20:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:21:01,816 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:21:01,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:21:01,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366893858] [2023-11-23 21:21:01,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366893858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:21:01,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715332345] [2023-11-23 21:21:01,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:21:01,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:21:01,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:21:01,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:21:01,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:21:02,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 21:21:02,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:21:02,528 WARN L260 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 201 conjunts are in the unsatisfiable core [2023-11-23 21:21:02,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:21:02,571 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 21:21:02,572 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-11-23 21:21:02,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:02,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:02,906 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-11-23 21:21:03,617 INFO L349 Elim1Store]: treesize reduction 342, result has 21.0 percent of original size [2023-11-23 21:21:03,618 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-11-23 21:21:04,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:04,296 INFO L224 Elim1Store]: Index analysis took 154 ms [2023-11-23 21:21:04,300 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-11-23 21:21:05,885 INFO L349 Elim1Store]: treesize reduction 342, result has 21.0 percent of original size [2023-11-23 21:21:05,886 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-11-23 21:21:06,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:21:06,286 INFO L224 Elim1Store]: Index analysis took 217 ms [2023-11-23 21:21:06,289 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-11-23 21:21:07,323 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-23 21:21:07,328 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-11-23 21:21:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:21:07,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:21:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:21:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715332345] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:21:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [869856229] [2023-11-23 21:21:14,252 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-11-23 21:21:14,252 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:21:14,253 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-11-23 21:21:14,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:21:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 34 [2023-11-23 21:21:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669536449] [2023-11-23 21:21:14,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:21:14,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-23 21:21:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:21:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-23 21:21:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=913, Unknown=2, NotChecked=0, Total=1122 [2023-11-23 21:21:14,258 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 34 states, 32 states have (on average 1.5) internal successors, (48), 23 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-11-23 21:21:22,281 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-11-23 21:21:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:21:22,464 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-11-23 21:21:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 21:21:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.5) internal successors, (48), 23 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-11-23 21:21:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:21:22,471 INFO L225 Difference]: With dead ends: 29 [2023-11-23 21:21:22,471 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 21:21:22,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=431, Invalid=1817, Unknown=8, NotChecked=0, Total=2256 [2023-11-23 21:21:22,478 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-23 21:21:22,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 31 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 169 Invalid, 3 Unknown, 0 Unchecked, 3.5s Time] [2023-11-23 21:21:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 21:21:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 21:21:22,483 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-11-23 21:21:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 21:21:22,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-11-23 21:21:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:21:22,483 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 21:21:22,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.5) internal successors, (48), 23 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-11-23 21:21:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 21:21:22,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 21:21:22,487 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 21:21:22,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 21:21:22,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:21:22,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 21:21:33,336 WARN L293 SmtUtils]: Spent 10.60s on a formula simplification. DAG size of input: 483 DAG size of output: 280 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-23 21:21:36,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 21:21:36,339 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-11-23 21:21:36,339 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-23 21:21:36,339 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 21:21:36,340 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2023-11-23 21:21:36,340 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_25_0EXIT(lines 37 52) no Hoare annotation was computed. [2023-11-23 21:21:36,340 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 28) no Hoare annotation was computed. [2023-11-23 21:21:36,340 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 33) no Hoare annotation was computed. [2023-11-23 21:21:36,340 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 20 35) no Hoare annotation was computed. [2023-11-23 21:21:36,343 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-11-23 21:21:36,345 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-11-23 21:21:36,346 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 51) no Hoare annotation was computed. [2023-11-23 21:21:36,346 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 37 52) no Hoare annotation was computed. [2023-11-23 21:21:36,350 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-11-23 21:21:36,354 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:21:36,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:21:36 BoogieIcfgContainer [2023-11-23 21:21:36,360 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:21:36,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:21:36,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:21:36,361 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:21:36,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:49" (3/4) ... [2023-11-23 21:21:36,364 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 21:21:36,369 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_25_0 [2023-11-23 21:21:36,375 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-23 21:21:36,375 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 21:21:36,376 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 21:21:36,376 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 21:21:36,486 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/witness.graphml [2023-11-23 21:21:36,487 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/witness.yml [2023-11-23 21:21:36,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:21:36,488 INFO L158 Benchmark]: Toolchain (without parser) took 48231.65ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 138.2MB in the beginning and 204.9MB in the end (delta: -66.6MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2023-11-23 21:21:36,488 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:21:36,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.99ms. Allocated memory is still 165.7MB. Free memory was 138.0MB in the beginning and 129.0MB in the end (delta: 9.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2023-11-23 21:21:36,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.41ms. Allocated memory is still 165.7MB. Free memory was 129.0MB in the beginning and 127.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:21:36,490 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 165.7MB. Free memory was 127.7MB in the beginning and 126.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:21:36,490 INFO L158 Benchmark]: RCFGBuilder took 565.25ms. Allocated memory is still 165.7MB. Free memory was 126.2MB in the beginning and 130.0MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 21:21:36,491 INFO L158 Benchmark]: TraceAbstraction took 47191.64ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 129.2MB in the beginning and 209.0MB in the end (delta: -79.9MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. [2023-11-23 21:21:36,495 INFO L158 Benchmark]: Witness Printer took 126.64ms. Allocated memory is still 287.3MB. Free memory was 209.0MB in the beginning and 204.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:21:36,502 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.26ms. Allocated memory is still 130.0MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.99ms. Allocated memory is still 165.7MB. Free memory was 138.0MB in the beginning and 129.0MB in the end (delta: 9.0MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.41ms. Allocated memory is still 165.7MB. Free memory was 129.0MB in the beginning and 127.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 165.7MB. Free memory was 127.7MB in the beginning and 126.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 565.25ms. Allocated memory is still 165.7MB. Free memory was 126.2MB in the beginning and 130.0MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47191.64ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 129.2MB in the beginning and 209.0MB in the end (delta: -79.9MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. * Witness Printer took 126.64ms. Allocated memory is still 287.3MB. Free memory was 209.0MB in the beginning and 204.9MB 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: 47.1s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 20 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 14.9s 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, 1113824 FormulaSimplificationTreeSizeReductionInter, 13.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 95 ConstructedInterpolants, 10 QuantifiedInterpolants, 1476720 SizeOfPredicates, 85 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 11/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-11-23 21:21:36,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1efb88f9-c4ab-4706-bebe-d8fd6f41b334/bin/utaipan-verify-mE87zJ7Ire/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