./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/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_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E --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.3.0-dev-826ab2b [2024-11-14 03:41:48,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:41:49,064 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 03:41:49,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:41:49,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:41:49,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:41:49,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:41:49,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:41:49,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:41:49,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:41:49,107 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:41:49,107 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:41:49,107 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:41:49,107 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:41:49,107 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:41:49,107 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:41:49,109 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:41:49,109 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:41:49,110 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:41:49,110 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:41:49,110 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:41:49,110 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:41:49,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:41:49,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:41:49,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:41:49,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:41:49,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:41:49,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:41:49,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:41:49,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:41:49,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:41:49,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:41:49,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:41:49,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:41:49,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:41:49,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:41:49,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:41:49,114 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:41:49,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:41:49,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:41:49,115 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:41:49,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:41:49,115 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E 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 [2024-11-14 03:41:49,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:41:49,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:41:49,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:41:49,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:41:49,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:41:49,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c Unable to find full path for "g++" [2024-11-14 03:41:51,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:41:51,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:41:51,613 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-14 03:41:51,624 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/data/be9cc6d2a/c200277e01784337bec2a8d66837e548/FLAG392379cdc [2024-11-14 03:41:51,648 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/data/be9cc6d2a/c200277e01784337bec2a8d66837e548 [2024-11-14 03:41:51,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:41:51,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:41:51,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:41:51,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:41:51,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:41:51,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:51,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b46b373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51, skipping insertion in model container [2024-11-14 03:41:51,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:51,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:41:51,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:41:51,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:41:51,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:41:51,939 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:41:51,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51 WrapperNode [2024-11-14 03:41:51,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:41:51,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:41:51,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:41:51,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:41:51,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:51,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:51,982 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-11-14 03:41:51,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:41:51,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:41:51,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:41:51,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:41:51,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:51,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:51,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:41:52,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:41:52,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:41:52,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:41:52,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (1/1) ... [2024-11-14 03:41:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:41:52,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:41:52,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:41:52,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:41:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:41:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:41:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:41:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:41:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-14 03:41:52,112 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-14 03:41:52,112 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-14 03:41:52,112 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-14 03:41:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:41:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:41:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:41:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-14 03:41:52,113 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-14 03:41:52,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:41:52,203 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:41:52,205 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:41:52,406 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-14 03:41:52,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:41:52,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:41:52,471 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:41:52,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:41:52 BoogieIcfgContainer [2024-11-14 03:41:52,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:41:52,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:41:52,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:41:52,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:41:52,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:41:51" (1/3) ... [2024-11-14 03:41:52,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158e55f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:41:52, skipping insertion in model container [2024-11-14 03:41:52,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:41:51" (2/3) ... [2024-11-14 03:41:52,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158e55f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:41:52, skipping insertion in model container [2024-11-14 03:41:52,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:41:52" (3/3) ... [2024-11-14 03:41:52,483 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-14 03:41:52,501 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:41:52,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_3.c that has 4 procedures, 35 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2024-11-14 03:41:52,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:41:52,588 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d740e3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:41:52,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-14 03:41:52,594 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) [2024-11-14 03:41:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:41:52,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:52,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:52,604 INFO L396 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)] === [2024-11-14 03:41:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1687961075, now seen corresponding path program 1 times [2024-11-14 03:41:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:52,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919407175] [2024-11-14 03:41:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:53,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919407175] [2024-11-14 03:41:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919407175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:41:53,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:41:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:41:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823672466] [2024-11-14 03:41:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:41:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:41:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:41:53,394 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) [2024-11-14 03:41:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:53,593 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-14 03:41:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:41:53,596 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 [2024-11-14 03:41:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:53,603 INFO L225 Difference]: With dead ends: 48 [2024-11-14 03:41:53,603 INFO L226 Difference]: Without dead ends: 42 [2024-11-14 03:41:53,607 INFO L431 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 [2024-11-14 03:41:53,610 INFO L432 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 [2024-11-14 03:41:53,611 INFO L433 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] [2024-11-14 03:41:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-14 03:41:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-11-14 03:41:53,654 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) [2024-11-14 03:41:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-14 03:41:53,664 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2024-11-14 03:41:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:53,664 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-14 03:41:53,665 INFO L472 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) [2024-11-14 03:41:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-14 03:41:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:41:53,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:53,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:53,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:41:53,669 INFO L396 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)] === [2024-11-14 03:41:53,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1680998632, now seen corresponding path program 1 times [2024-11-14 03:41:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039252071] [2024-11-14 03:41:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:53,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039252071] [2024-11-14 03:41:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039252071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:41:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:41:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:41:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107577444] [2024-11-14 03:41:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:41:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:41:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:41:53,999 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) [2024-11-14 03:41:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:54,163 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-14 03:41:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:41:54,164 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 [2024-11-14 03:41:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:54,166 INFO L225 Difference]: With dead ends: 76 [2024-11-14 03:41:54,166 INFO L226 Difference]: Without dead ends: 41 [2024-11-14 03:41:54,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:41:54,169 INFO L432 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 [2024-11-14 03:41:54,169 INFO L433 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] [2024-11-14 03:41:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-14 03:41:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-14 03:41:54,179 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) [2024-11-14 03:41:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-14 03:41:54,183 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2024-11-14 03:41:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:54,184 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-14 03:41:54,184 INFO L472 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) [2024-11-14 03:41:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-14 03:41:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:41:54,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:54,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:54,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:41:54,186 INFO L396 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)] === [2024-11-14 03:41:54,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash -564507169, now seen corresponding path program 1 times [2024-11-14 03:41:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803559143] [2024-11-14 03:41:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:54,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:54,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803559143] [2024-11-14 03:41:54,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803559143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:41:54,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:41:54,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:41:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917771240] [2024-11-14 03:41:54,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:54,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:41:54,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:54,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:41:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:41:54,462 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) [2024-11-14 03:41:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:54,588 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2024-11-14 03:41:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:41:54,589 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 [2024-11-14 03:41:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:54,590 INFO L225 Difference]: With dead ends: 80 [2024-11-14 03:41:54,591 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 03:41:54,592 INFO L431 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 [2024-11-14 03:41:54,593 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:41:54,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 81 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:41:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 03:41:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-14 03:41:54,598 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) [2024-11-14 03:41:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-14 03:41:54,600 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2024-11-14 03:41:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:54,600 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-14 03:41:54,600 INFO L472 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) [2024-11-14 03:41:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-14 03:41:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:41:54,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:54,601 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:54,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:41:54,602 INFO L396 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)] === [2024-11-14 03:41:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 789392049, now seen corresponding path program 1 times [2024-11-14 03:41:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386336822] [2024-11-14 03:41:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:55,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386336822] [2024-11-14 03:41:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386336822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:41:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75351513] [2024-11-14 03:41:55,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:55,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:55,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:41:55,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:41:55,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:41:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:55,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:41:55,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:41:55,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:41:55,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-14 03:41:55,349 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 [2024-11-14 03:41:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:55,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:41:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:55,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75351513] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:41:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:41:55,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 8] total 17 [2024-11-14 03:41:55,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10539052] [2024-11-14 03:41:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:55,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:41:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:41:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:41:55,493 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) [2024-11-14 03:41:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:55,630 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-14 03:41:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:41:55,631 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 [2024-11-14 03:41:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:55,632 INFO L225 Difference]: With dead ends: 42 [2024-11-14 03:41:55,632 INFO L226 Difference]: Without dead ends: 41 [2024-11-14 03:41:55,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:41:55,633 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:41:55,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:41:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-14 03:41:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-14 03:41:55,640 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) [2024-11-14 03:41:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-14 03:41:55,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2024-11-14 03:41:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:55,641 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-14 03:41:55,641 INFO L472 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) [2024-11-14 03:41:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-14 03:41:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:41:55,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:55,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:55,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 03:41:55,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:55,847 INFO L396 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)] === [2024-11-14 03:41:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1298650220, now seen corresponding path program 1 times [2024-11-14 03:41:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:55,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032573091] [2024-11-14 03:41:55,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:41:55,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:55,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032573091] [2024-11-14 03:41:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032573091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:41:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:41:55,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:41:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364066026] [2024-11-14 03:41:55,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:41:55,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:41:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:41:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:41:55,934 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) [2024-11-14 03:41:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:55,984 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-14 03:41:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:41:55,985 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 [2024-11-14 03:41:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:55,986 INFO L225 Difference]: With dead ends: 38 [2024-11-14 03:41:55,986 INFO L226 Difference]: Without dead ends: 37 [2024-11-14 03:41:55,986 INFO L431 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 [2024-11-14 03:41:55,987 INFO L432 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 [2024-11-14 03:41:55,987 INFO L433 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] [2024-11-14 03:41:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-14 03:41:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-14 03:41:56,000 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) [2024-11-14 03:41:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-14 03:41:56,001 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2024-11-14 03:41:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:56,002 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-14 03:41:56,002 INFO L472 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) [2024-11-14 03:41:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-14 03:41:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:41:56,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:56,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:41:56,003 INFO L396 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)] === [2024-11-14 03:41:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1900896519, now seen corresponding path program 1 times [2024-11-14 03:41:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163783541] [2024-11-14 03:41:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:41:56,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163783541] [2024-11-14 03:41:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163783541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:41:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126377304] [2024-11-14 03:41:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:56,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:56,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:41:56,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:41:56,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:41:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:56,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 03:41:56,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:41:56,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:41:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:41:56,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:41:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:41:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126377304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:41:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122357342] [2024-11-14 03:41:57,556 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:41:57,556 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:41:57,560 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:41:57,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:41:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2024-11-14 03:41:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220577589] [2024-11-14 03:41:57,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:41:57,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 03:41:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:41:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 03:41:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:41:57,566 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) [2024-11-14 03:41:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:41:58,016 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-11-14 03:41:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:41:58,017 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 [2024-11-14 03:41:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:41:58,017 INFO L225 Difference]: With dead ends: 72 [2024-11-14 03:41:58,017 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 03:41:58,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2024-11-14 03:41:58,019 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:41:58,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 152 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:41:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 03:41:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-14 03:41:58,032 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) [2024-11-14 03:41:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-14 03:41:58,033 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2024-11-14 03:41:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:41:58,036 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-14 03:41:58,036 INFO L472 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) [2024-11-14 03:41:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-14 03:41:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:41:58,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:41:58,038 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:41:58,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:41:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:58,238 INFO L396 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)] === [2024-11-14 03:41:58,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:41:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1794443403, now seen corresponding path program 2 times [2024-11-14 03:41:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:41:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439008004] [2024-11-14 03:41:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:41:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:41:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:41:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 03:41:59,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:41:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439008004] [2024-11-14 03:41:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439008004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:41:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867524924] [2024-11-14 03:41:59,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:41:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:41:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:41:59,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:41:59,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:41:59,228 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-14 03:41:59,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:41:59,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 03:41:59,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:41:59,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:41:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:41:59,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:42:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:42:01,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867524924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:42:01,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756892867] [2024-11-14 03:42:01,675 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:42:01,676 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:42:01,676 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:42:01,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:42:01,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 21] total 43 [2024-11-14 03:42:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501942253] [2024-11-14 03:42:01,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:42:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:42:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:42:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2024-11-14 03:42:01,681 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) [2024-11-14 03:42:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:02,624 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2024-11-14 03:42:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:42:02,625 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 [2024-11-14 03:42:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:02,626 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:42:02,626 INFO L226 Difference]: Without dead ends: 65 [2024-11-14 03:42:02,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=494, Invalid=2928, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 03:42:02,631 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:02,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 293 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:42:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-14 03:42:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2024-11-14 03:42:02,654 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) [2024-11-14 03:42:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-14 03:42:02,655 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2024-11-14 03:42:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:02,655 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-14 03:42:02,655 INFO L472 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) [2024-11-14 03:42:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-14 03:42:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 03:42:02,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:02,656 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:02,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 03:42:02,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:42:02,861 INFO L396 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)] === [2024-11-14 03:42:02,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1540706801, now seen corresponding path program 3 times [2024-11-14 03:42:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305073318] [2024-11-14 03:42:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-14 03:42:03,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305073318] [2024-11-14 03:42:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305073318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:42:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393352207] [2024-11-14 03:42:03,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:42:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:42:03,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:42:03,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:42:03,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:42:04,119 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:42:04,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:42:04,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-14 03:42:04,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:04,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:42:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-14 03:42:04,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:42:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:42:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393352207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:42:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [53331103] [2024-11-14 03:42:07,896 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:42:07,896 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:42:07,897 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:42:07,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:42:07,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 31] total 55 [2024-11-14 03:42:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446960203] [2024-11-14 03:42:07,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:42:07,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-14 03:42:07,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-14 03:42:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 03:42:07,903 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-14 03:42:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:08,752 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2024-11-14 03:42:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:42:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 49 [2024-11-14 03:42:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:08,753 INFO L225 Difference]: With dead ends: 86 [2024-11-14 03:42:08,753 INFO L226 Difference]: Without dead ends: 45 [2024-11-14 03:42:08,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=738, Invalid=4092, Unknown=0, NotChecked=0, Total=4830 [2024-11-14 03:42:08,757 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:08,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 315 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:42:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-14 03:42:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-14 03:42:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 31 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-14 03:42:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-11-14 03:42:08,765 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 49 [2024-11-14 03:42:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:08,766 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-14 03:42:08,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-14 03:42:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-14 03:42:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 03:42:08,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:08,767 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:42:08,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:42:08,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:42:08,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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)] === [2024-11-14 03:42:08,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash -630751917, now seen corresponding path program 4 times [2024-11-14 03:42:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:08,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688158024] [2024-11-14 03:42:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-14 03:42:13,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688158024] [2024-11-14 03:42:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688158024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:42:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706087436] [2024-11-14 03:42:13,320 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:42:13,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:42:13,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:42:13,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:42:13,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:42:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:13,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-14 03:42:13,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:13,473 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 [2024-11-14 03:42:13,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:42:13,505 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 [2024-11-14 03:42:15,689 WARN L851 $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_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from false [2024-11-14 03:42:17,696 WARN L873 $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_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from true [2024-11-14 03:42:19,744 WARN L851 $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_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |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))))) is different from false [2024-11-14 03:42:21,745 WARN L873 $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_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |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))))) is different from true [2024-11-14 03:42:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 11 not checked. [2024-11-14 03:42:21,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:42:22,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706087436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:42:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337217153] [2024-11-14 03:42:22,171 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:42:22,171 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:42:22,171 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:42:22,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:42:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 15 [2024-11-14 03:42:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948064156] [2024-11-14 03:42:22,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:42:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 03:42:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:42:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 03:42:22,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=11, NotChecked=66, Total=380 [2024-11-14 03:42:22,174 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:42:24,347 WARN L851 $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_24| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |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| 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 [2024-11-14 03:42:26,349 WARN L873 $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_24| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |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| 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 [2024-11-14 03:42:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:26,440 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-14 03:42:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:42:26,441 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2024-11-14 03:42:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:26,442 INFO L225 Difference]: With dead ends: 55 [2024-11-14 03:42:26,442 INFO L226 Difference]: Without dead ends: 51 [2024-11-14 03:42:26,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=107, Invalid=542, Unknown=13, NotChecked=150, Total=812 [2024-11-14 03:42:26,443 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:26,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 137 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 101 Unchecked, 0.1s Time] [2024-11-14 03:42:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-14 03:42:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-14 03:42:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 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) [2024-11-14 03:42:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-14 03:42:26,453 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 56 [2024-11-14 03:42:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:26,453 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-14 03:42:26,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:42:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-14 03:42:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 03:42:26,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:26,455 INFO L215 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] [2024-11-14 03:42:26,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:42:26,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:42:26,656 INFO L396 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)] === [2024-11-14 03:42:26,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 104174786, now seen corresponding path program 1 times [2024-11-14 03:42:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:42:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721319276] [2024-11-14 03:42:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:42:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-14 03:42:30,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:42:30,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721319276] [2024-11-14 03:42:30,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721319276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:42:30,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146908377] [2024-11-14 03:42:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:30,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:42:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:42:30,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:42:30,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d376dd-74e2-4ead-81d3-9c14f875e266/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:42:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:30,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-14 03:42:30,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:30,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:42:30,347 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 [2024-11-14 03:42:30,427 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 19 treesize of output 18 [2024-11-14 03:42:32,739 WARN L851 $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_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2024-11-14 03:42:34,740 WARN L873 $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_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2024-11-14 03:42:36,886 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2024-11-14 03:42:36,888 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2024-11-14 03:42:38,910 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (<= |c_func_to_recursive_line_22_to_23_0_#t~mem8| (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2024-11-14 03:42:38,913 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (<= |c_func_to_recursive_line_22_to_23_0_#t~mem8| (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2024-11-14 03:42:38,980 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset))) (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (and (<= .cse0 (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)) (= (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse3 (select |v_#memory_int_312| .cse3))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_36| .cse3)))))) (= (store |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|) (<= .cse0 (+ 1 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset)))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2024-11-14 03:42:38,985 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset))) (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (and (<= .cse0 (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)) (= (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse3 (select |v_#memory_int_312| .cse3))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_36| .cse3)))))) (= (store |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|) (<= .cse0 (+ 1 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset)))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2024-11-14 03:42:39,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (or (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |v_#memory_int_312| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)))))) (= (store |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)) (= |c_#memory_int| (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)))))))) (<= 6 .cse2))) is different from false [2024-11-14 03:42:39,080 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (or (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |v_#memory_int_312| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)))))) (= (store |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)) (= |c_#memory_int| (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)))))))) (<= 6 .cse2))) is different from true [2024-11-14 03:42:39,263 INFO L349 Elim1Store]: treesize reduction 95, result has 34.5 percent of original size [2024-11-14 03:42:39,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 246 [2024-11-14 03:42:39,379 INFO L349 Elim1Store]: treesize reduction 132, result has 9.6 percent of original size [2024-11-14 03:42:39,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 60 [2024-11-14 03:42:39,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:42:39,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2024-11-14 03:42:39,579 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:42:39,581 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:42:39,586 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 0 case distinctions, treesize of input 58 treesize of output 40 [2024-11-14 03:42:39,618 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:42:39,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:42:39,631 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2024-11-14 03:42:39,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 40 [2024-11-14 03:42:41,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~a.base))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= (select (select (store |c_#memory_int| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)) c_func_to_recursive_line_21_to_22_0_~a.base) c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (not (= .cse0 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse0) func_to_recursive_line_21_to_22_0_~b.offset))))) (and (= (select .cse1 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (not (= .cse2 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse2) func_to_recursive_line_21_to_22_0_~b.offset))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_14) .cse4 (select |v_old(#memory_int)_AFTER_CALL_36| .cse4))) func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse3 func_to_recursive_line_21_to_22_0_~b.offset) 0) (= .cse3 v_DerPreprocessor_14)))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse7 (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_10) .cse8 (select |v_old(#memory_int)_AFTER_CALL_36| .cse8))))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_21_to_22_0_~a.base)) (.cse6 (select .cse7 func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse5 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (= .cse5 .cse1) (= 0 (select .cse6 func_to_recursive_line_21_to_22_0_~b.offset)) (= .cse6 v_DerPreprocessor_10))))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) is different from false [2024-11-14 03:42:41,880 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~a.base))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= (select (select (store |c_#memory_int| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)) c_func_to_recursive_line_21_to_22_0_~a.base) c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (not (= .cse0 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse0) func_to_recursive_line_21_to_22_0_~b.offset))))) (and (= (select .cse1 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (not (= .cse2 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse2) func_to_recursive_line_21_to_22_0_~b.offset))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_14) .cse4 (select |v_old(#memory_int)_AFTER_CALL_36| .cse4))) func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse3 func_to_recursive_line_21_to_22_0_~b.offset) 0) (= .cse3 v_DerPreprocessor_14)))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse7 (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_10) .cse8 (select |v_old(#memory_int)_AFTER_CALL_36| .cse8))))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_21_to_22_0_~a.base)) (.cse6 (select .cse7 func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse5 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (= .cse5 .cse1) (= 0 (select .cse6 func_to_recursive_line_21_to_22_0_~b.offset)) (= .cse6 v_DerPreprocessor_10))))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) is different from true [2024-11-14 03:42:42,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:42:42,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 468 treesize of output 530 [2024-11-14 03:42:42,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:42:42,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:42:57,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:42:57,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-14 03:43:24,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:43:24,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:24,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-14 03:43:24,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:24,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-14 03:43:24,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:24,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 121 [2024-11-14 03:43:24,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:24,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 150 [2024-11-14 03:43:31,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:31,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 166 [2024-11-14 03:43:32,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:32,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-14 03:43:32,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:32,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2024-11-14 03:43:34,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:43:34,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 197 treesize of output 467