./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:10:20,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:10:20,976 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-25 00:10:20,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:10:20,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:10:21,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:10:21,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:10:21,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:10:21,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:10:21,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:10:21,054 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:10:21,055 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:10:21,055 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:10:21,057 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:10:21,058 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:10:21,058 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:10:21,059 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:10:21,059 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:10:21,060 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:10:21,060 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:10:21,061 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:10:21,065 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:10:21,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:10:21,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:10:21,068 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:10:21,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:10:21,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:10:21,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:10:21,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:10:21,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:10:21,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:10:21,072 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-25 00:10:21,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:10:21,072 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:10:21,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:10:21,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:10:21,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:10:21,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:10:21,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:10:21,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:10:21,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:10:21,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:10:21,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:10:21,075 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:10:21,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:10:21,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:10:21,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:10:21,077 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:10:21,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:10:21,077 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_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/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_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91 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 ! overflow) ) 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-25 00:10:21,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:10:21,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:10:21,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:10:21,438 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:10:21,438 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:10:21,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-25 00:10:24,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:10:24,885 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:10:24,886 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-25 00:10:24,895 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/data/fd989f1e4/582b8addf4b84444a79cec2e8c0f1633/FLAG44b453d12 [2023-11-25 00:10:24,911 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/data/fd989f1e4/582b8addf4b84444a79cec2e8c0f1633 [2023-11-25 00:10:24,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:10:24,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:10:24,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:10:24,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:10:24,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:10:24,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:10:24" (1/1) ... [2023-11-25 00:10:24,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffc3518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:24, skipping insertion in model container [2023-11-25 00:10:24,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:10:24" (1/1) ... [2023-11-25 00:10:24,951 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:10:25,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:10:25,156 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:10:25,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:10:25,205 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:10:25,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25 WrapperNode [2023-11-25 00:10:25,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:10:25,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:10:25,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:10:25,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:10:25,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,249 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-25 00:10:25,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:10:25,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:10:25,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:10:25,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:10:25,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:10:25,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:10:25,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:10:25,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:10:25,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (1/1) ... [2023-11-25 00:10:25,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:10:25,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:25,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:10:25,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:10:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:10:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:10:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:10:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:10:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-25 00:10:25,410 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-25 00:10:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-25 00:10:25,410 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-25 00:10:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:10:25,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:10:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:10:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-25 00:10:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-25 00:10:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:10:25,515 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:10:25,518 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:10:25,764 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:10:25,844 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:10:25,844 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:10:25,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:10:25 BoogieIcfgContainer [2023-11-25 00:10:25,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:10:25,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:10:25,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:10:25,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:10:25,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:10:24" (1/3) ... [2023-11-25 00:10:25,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66be5ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:10:25, skipping insertion in model container [2023-11-25 00:10:25,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:10:25" (2/3) ... [2023-11-25 00:10:25,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66be5ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:10:25, skipping insertion in model container [2023-11-25 00:10:25,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:10:25" (3/3) ... [2023-11-25 00:10:25,857 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-25 00:10:25,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:10:25,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-25 00:10:25,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:10:25,945 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;@3ca75dc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:10:25,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-25 00:10:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-25 00:10:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:10:25,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:25,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:25,961 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:25,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1687961075, now seen corresponding path program 1 times [2023-11-25 00:10:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:25,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033909994] [2023-11-25 00:10:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:26,596 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-25 00:10:26,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033909994] [2023-11-25 00:10:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033909994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:10:26,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:10:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:10:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079439241] [2023-11-25 00:10:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:10:26,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:10:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:26,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:10:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:10:26,659 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:10:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:26,914 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-25 00:10:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:10:26,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-25 00:10:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:26,925 INFO L225 Difference]: With dead ends: 48 [2023-11-25 00:10:26,926 INFO L226 Difference]: Without dead ends: 42 [2023-11-25 00:10:26,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:10:26,934 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:26,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:10:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-25 00:10:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-11-25 00:10:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-25 00:10:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-25 00:10:26,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2023-11-25 00:10:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:26,984 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-25 00:10:26,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:10:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-25 00:10:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:10:26,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:26,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:26,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:10:26,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:26,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1680998632, now seen corresponding path program 1 times [2023-11-25 00:10:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:26,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878264523] [2023-11-25 00:10:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:27,316 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-25 00:10:27,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:27,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878264523] [2023-11-25 00:10:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878264523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:10:27,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:10:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:10:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125828728] [2023-11-25 00:10:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:10:27,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:10:27,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:10:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:10:27,325 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:10:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:27,443 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-11-25 00:10:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:10:27,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-25 00:10:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:27,447 INFO L225 Difference]: With dead ends: 76 [2023-11-25 00:10:27,447 INFO L226 Difference]: Without dead ends: 41 [2023-11-25 00:10:27,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:10:27,450 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:27,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:10:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-25 00:10:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-25 00:10:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 32 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-25 00:10:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-25 00:10:27,462 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2023-11-25 00:10:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:27,462 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-25 00:10:27,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:10:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-25 00:10:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-25 00:10:27,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:27,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:27,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:10:27,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:27,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -564507169, now seen corresponding path program 1 times [2023-11-25 00:10:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:27,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420280634] [2023-11-25 00:10:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:27,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:27,700 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-25 00:10:27,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420280634] [2023-11-25 00:10:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420280634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:10:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:10:27,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:10:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681560556] [2023-11-25 00:10:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:10:27,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:10:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:27,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:10:27,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:10:27,704 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:10:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:27,789 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2023-11-25 00:10:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:10:27,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-25 00:10:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:27,791 INFO L225 Difference]: With dead ends: 80 [2023-11-25 00:10:27,791 INFO L226 Difference]: Without dead ends: 39 [2023-11-25 00:10:27,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:10:27,794 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:27,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:10:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-25 00:10:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-25 00:10:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:10:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-25 00:10:27,803 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2023-11-25 00:10:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:27,803 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-25 00:10:27,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:10:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-25 00:10:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-25 00:10:27,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:27,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:10:27,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:27,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 789392049, now seen corresponding path program 1 times [2023-11-25 00:10:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516789104] [2023-11-25 00:10:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:28,096 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-25 00:10:28,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516789104] [2023-11-25 00:10:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516789104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701802537] [2023-11-25 00:10:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:28,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:28,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:28,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:28,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:10:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:28,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-25 00:10:28,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:28,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-25 00:10:28,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-25 00:10:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:10:28,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:10:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701802537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:10:28,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-25 00:10:28,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-11-25 00:10:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897010221] [2023-11-25 00:10:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:10:28,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:10:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:10:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:10:28,430 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 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-25 00:10:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:28,548 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-25 00:10:28,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:10:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-25 00:10:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:28,552 INFO L225 Difference]: With dead ends: 42 [2023-11-25 00:10:28,552 INFO L226 Difference]: Without dead ends: 41 [2023-11-25 00:10:28,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-25 00:10:28,558 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:28,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:10:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-25 00:10:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2023-11-25 00:10:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:10:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-25 00:10:28,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2023-11-25 00:10:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:28,579 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-25 00:10:28,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 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-25 00:10:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-25 00:10:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:10:28,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:28,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:28,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:28,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:28,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:28,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:28,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1298650220, now seen corresponding path program 1 times [2023-11-25 00:10:28,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:28,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264992814] [2023-11-25 00:10:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:10:28,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264992814] [2023-11-25 00:10:28,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264992814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:10:28,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:10:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:10:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157930531] [2023-11-25 00:10:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:10:28,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:10:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:10:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:10:28,876 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 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-25 00:10:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:28,917 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-25 00:10:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:10:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-25 00:10:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:28,920 INFO L225 Difference]: With dead ends: 38 [2023-11-25 00:10:28,920 INFO L226 Difference]: Without dead ends: 37 [2023-11-25 00:10:28,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:10:28,922 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:28,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:10:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-25 00:10:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-25 00:10:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:10:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-25 00:10:28,942 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2023-11-25 00:10:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:28,943 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-25 00:10:28,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 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-25 00:10:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-25 00:10:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:10:28,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:28,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:28,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:10:28,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:28,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1900896519, now seen corresponding path program 1 times [2023-11-25 00:10:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214652515] [2023-11-25 00:10:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:10:29,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214652515] [2023-11-25 00:10:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214652515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822958033] [2023-11-25 00:10:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:29,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:29,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:29,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:29,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:10:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:29,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-25 00:10:29,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:29,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:10:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:10:29,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:10:30,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822958033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:10:30,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [659663849] [2023-11-25 00:10:30,147 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-25 00:10:30,148 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:30,152 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-25 00:10:30,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:10:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2023-11-25 00:10:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135011165] [2023-11-25 00:10:30,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:10:30,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-25 00:10:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-25 00:10:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2023-11-25 00:10:30,162 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-25 00:10:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:30,533 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-25 00:10:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:10:30,533 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2023-11-25 00:10:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:30,534 INFO L225 Difference]: With dead ends: 72 [2023-11-25 00:10:30,534 INFO L226 Difference]: Without dead ends: 39 [2023-11-25 00:10:30,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2023-11-25 00:10:30,536 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:30,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:10:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-25 00:10:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-25 00:10:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-25 00:10:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-25 00:10:30,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2023-11-25 00:10:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:30,544 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-25 00:10:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-25 00:10:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-25 00:10:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-25 00:10:30,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:30,546 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:30,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:30,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-25 00:10:30,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:30,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1794443403, now seen corresponding path program 2 times [2023-11-25 00:10:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752589382] [2023-11-25 00:10:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-25 00:10:31,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752589382] [2023-11-25 00:10:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752589382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:31,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406136264] [2023-11-25 00:10:31,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:10:31,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:31,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:31,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:10:31,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-25 00:10:31,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:10:31,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-25 00:10:31,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:31,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:10:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-25 00:10:32,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:10:34,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406136264] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:10:34,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926476332] [2023-11-25 00:10:34,019 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-25 00:10:34,019 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:34,019 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-25 00:10:34,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:10:34,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 21] total 43 [2023-11-25 00:10:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721265311] [2023-11-25 00:10:34,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:10:34,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-25 00:10:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-25 00:10:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2023-11-25 00:10:34,024 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-25 00:10:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:34,790 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2023-11-25 00:10:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-25 00:10:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 35 [2023-11-25 00:10:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:34,792 INFO L225 Difference]: With dead ends: 80 [2023-11-25 00:10:34,792 INFO L226 Difference]: Without dead ends: 43 [2023-11-25 00:10:34,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=462, Invalid=2730, Unknown=0, NotChecked=0, Total=3192 [2023-11-25 00:10:34,809 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:34,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 240 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:10:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-25 00:10:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-25 00:10:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-25 00:10:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-25 00:10:34,825 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2023-11-25 00:10:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:34,826 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-25 00:10:34,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-25 00:10:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-25 00:10:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-25 00:10:34,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:34,829 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:34,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:35,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-25 00:10:35,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:35,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:35,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1540706801, now seen corresponding path program 3 times [2023-11-25 00:10:35,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292383139] [2023-11-25 00:10:35,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-25 00:10:36,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292383139] [2023-11-25 00:10:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292383139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657432200] [2023-11-25 00:10:36,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:10:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:36,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:36,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:10:36,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:10:36,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:10:36,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-25 00:10:36,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:36,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2023-11-25 00:10:36,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:10:36,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:10:36,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:10:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-25 00:10:36,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:37,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657432200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632485913] [2023-11-25 00:10:37,290 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-25 00:10:37,290 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:37,291 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-25 00:10:37,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:10:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2023-11-25 00:10:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127254187] [2023-11-25 00:10:37,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:10:37,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-25 00:10:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-25 00:10:37,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=813, Unknown=6, NotChecked=0, Total=930 [2023-11-25 00:10:37,294 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 28 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 25 states have internal predecessors, (39), 9 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-25 00:10:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:38,051 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2023-11-25 00:10:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-25 00:10:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 25 states have internal predecessors, (39), 9 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 49 [2023-11-25 00:10:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:38,053 INFO L225 Difference]: With dead ends: 95 [2023-11-25 00:10:38,053 INFO L226 Difference]: Without dead ends: 52 [2023-11-25 00:10:38,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=1897, Unknown=6, NotChecked=0, Total=2162 [2023-11-25 00:10:38,056 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 49 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:38,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 163 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:10:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-25 00:10:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-11-25 00:10:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-25 00:10:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-11-25 00:10:38,065 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 49 [2023-11-25 00:10:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:38,066 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-11-25 00:10:38,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 25 states have internal predecessors, (39), 9 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-25 00:10:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-11-25 00:10:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-25 00:10:38,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:38,068 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:38,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:38,274 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:38,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:38,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1921527105, now seen corresponding path program 1 times [2023-11-25 00:10:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499656517] [2023-11-25 00:10:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-25 00:10:42,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499656517] [2023-11-25 00:10:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499656517] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658671778] [2023-11-25 00:10:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:42,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:42,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:10:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:43,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-25 00:10:43,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:43,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-25 00:10:43,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:10:43,394 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_42| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_42| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_42|))))) is different from false [2023-11-25 00:10:43,515 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_42| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_42| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_42|))))) is different from true [2023-11-25 00:10:43,558 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_20| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_20| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_20| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= .cse0 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_20| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2023-11-25 00:10:43,565 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_20| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_20| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_20| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= .cse0 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_20| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2023-11-25 00:10:43,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-25 00:10:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 11 not checked. [2023-11-25 00:10:43,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658671778] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [209086195] [2023-11-25 00:10:44,064 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-25 00:10:44,064 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:44,065 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-25 00:10:44,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:10:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2023-11-25 00:10:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548985419] [2023-11-25 00:10:44,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:10:44,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-25 00:10:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-25 00:10:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=398, Unknown=5, NotChecked=82, Total=552 [2023-11-25 00:10:44,068 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-25 00:10:44,303 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_42| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_42| .cse1 (select |c_#memory_int| .cse1))) (= .cse1 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_42|))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_20| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_20| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_20| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= .cse2 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_20| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2023-11-25 00:10:44,316 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_42| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_42| .cse1 (select |c_#memory_int| .cse1))) (= .cse1 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_42|))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_20| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_20| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_20| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= .cse2 |c_func_to_recursive_line_23_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_20| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2023-11-25 00:10:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:44,634 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-11-25 00:10:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-25 00:10:44,635 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.5625) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2023-11-25 00:10:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:44,637 INFO L225 Difference]: With dead ends: 67 [2023-11-25 00:10:44,637 INFO L226 Difference]: Without dead ends: 66 [2023-11-25 00:10:44,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1011, Unknown=7, NotChecked=204, Total=1406 [2023-11-25 00:10:44,639 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:44,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 274 Invalid, 0 Unknown, 139 Unchecked, 0.3s Time] [2023-11-25 00:10:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-25 00:10:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2023-11-25 00:10:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 44 states have internal predecessors, (46), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (16), 13 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-25 00:10:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-11-25 00:10:44,667 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 57 [2023-11-25 00:10:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:44,668 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-11-25 00:10:44,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.5625) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-25 00:10:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-11-25 00:10:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-25 00:10:44,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:44,673 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:44,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:44,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:44,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:44,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash 104174786, now seen corresponding path program 1 times [2023-11-25 00:10:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:44,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942585478] [2023-11-25 00:10:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-25 00:10:48,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:48,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942585478] [2023-11-25 00:10:48,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942585478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:48,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622714952] [2023-11-25 00:10:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:48,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:48,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:48,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:48,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:10:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:48,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-25 00:10:48,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:48,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-25 00:10:48,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:10:48,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:10:49,930 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_12 Int) (func_to_recursive_line_22_to_23_0_~c.base Int)) (and (= (store (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (store (select |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| v_DerPreprocessor_12)) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|)) |c_#memory_int|) (<= 6 v_DerPreprocessor_12))) is different from true [2023-11-25 00:10:49,984 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-25 00:10:49,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 30 [2023-11-25 00:10:50,003 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-25 00:10:50,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 29 [2023-11-25 00:10:50,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-25 00:10:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 77 trivial. 2 not checked. [2023-11-25 00:10:50,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622714952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1499536059] [2023-11-25 00:10:51,279 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-11-25 00:10:51,279 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:51,280 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-25 00:10:51,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:10:51,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2023-11-25 00:10:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190611490] [2023-11-25 00:10:51,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:10:51,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-25 00:10:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-25 00:10:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1270, Unknown=5, NotChecked=72, Total=1482 [2023-11-25 00:10:51,284 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 36 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 31 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (14), 13 states have call predecessors, (14), 9 states have call successors, (14) [2023-11-25 00:10:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:52,967 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2023-11-25 00:10:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-25 00:10:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 31 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (14), 13 states have call predecessors, (14), 9 states have call successors, (14) Word has length 66 [2023-11-25 00:10:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:52,972 INFO L225 Difference]: With dead ends: 133 [2023-11-25 00:10:52,973 INFO L226 Difference]: Without dead ends: 68 [2023-11-25 00:10:52,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=325, Invalid=3213, Unknown=6, NotChecked=116, Total=3660 [2023-11-25 00:10:52,976 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:52,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 321 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 734 Invalid, 0 Unknown, 50 Unchecked, 0.7s Time] [2023-11-25 00:10:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-25 00:10:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-11-25 00:10:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 43 states have internal predecessors, (45), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-25 00:10:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-11-25 00:10:53,001 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 66 [2023-11-25 00:10:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:53,001 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-11-25 00:10:53,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 31 states have internal predecessors, (47), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (14), 13 states have call predecessors, (14), 9 states have call successors, (14) [2023-11-25 00:10:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-11-25 00:10:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-25 00:10:53,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:53,008 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:53,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:53,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:53,215 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:10:53,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1143908004, now seen corresponding path program 1 times [2023-11-25 00:10:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955827244] [2023-11-25 00:10:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2023-11-25 00:10:59,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955827244] [2023-11-25 00:10:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955827244] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511949963] [2023-11-25 00:10:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:59,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:59,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:59,375 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:59,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-25 00:10:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:59,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-25 00:10:59,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:59,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2023-11-25 00:10:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-25 00:10:59,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-25 00:10:59,988 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2023-11-25 00:10:59,995 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2023-11-25 00:11:00,074 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_78| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_78| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_78| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_78|))))) is different from false [2023-11-25 00:11:00,082 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_78| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_78| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_78| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_78|))))) is different from true [2023-11-25 00:11:00,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-25 00:11:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 307 proven. 23 refuted. 0 times theorem prover too weak. 226 trivial. 11 not checked. [2023-11-25 00:11:00,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:11:00,576 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base v_ArrVal_492) c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)))) is different from false [2023-11-25 00:11:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511949963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:11:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1917172599] [2023-11-25 00:11:00,580 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-25 00:11:00,581 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:11:00,581 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-25 00:11:00,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:11:00,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 25 [2023-11-25 00:11:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335122188] [2023-11-25 00:11:00,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:11:00,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-25 00:11:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:11:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-25 00:11:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=567, Unknown=5, NotChecked=150, Total=812 [2023-11-25 00:11:00,584 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 26 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 17 states have internal predecessors, (39), 10 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-25 00:11:00,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|))))) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_78| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_78| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_78| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_78|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2023-11-25 00:11:00,877 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|))))) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_78| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_78| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_78| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_78|))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2023-11-25 00:11:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:11:01,201 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2023-11-25 00:11:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-25 00:11:01,202 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 17 states have internal predecessors, (39), 10 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 109 [2023-11-25 00:11:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:11:01,204 INFO L225 Difference]: With dead ends: 65 [2023-11-25 00:11:01,204 INFO L226 Difference]: Without dead ends: 64 [2023-11-25 00:11:01,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=1411, Unknown=7, NotChecked=324, Total=1980 [2023-11-25 00:11:01,206 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:11:01,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 132 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 306 Invalid, 0 Unknown, 108 Unchecked, 0.3s Time] [2023-11-25 00:11:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-25 00:11:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2023-11-25 00:11:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.131578947368421) internal successors, (43), 42 states have internal predecessors, (43), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-25 00:11:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-11-25 00:11:01,219 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 109 [2023-11-25 00:11:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:11:01,220 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-11-25 00:11:01,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 17 states have internal predecessors, (39), 10 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-25 00:11:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-11-25 00:11:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-25 00:11:01,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:11:01,222 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:11:01,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-25 00:11:01,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_19928e0d-d46d-4e25-a7b6-9b36446e8cbc/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-25 00:11:01,429 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-25 00:11:01,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:11:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1458967262, now seen corresponding path program 2 times [2023-11-25 00:11:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:11:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386193021] [2023-11-25 00:11:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:11:01,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:11:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat