./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje --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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:05:02,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:05:03,053 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-09 05:05:03,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:05:03,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:05:03,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:05:03,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:05:03,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:05:03,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:05:03,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:05:03,097 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:05:03,098 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:05:03,098 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:05:03,099 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:05:03,099 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:05:03,100 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:05:03,100 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:05:03,101 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:05:03,101 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:05:03,102 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:05:03,102 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:05:03,103 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:05:03,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:05:03,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:05:03,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:05:03,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:05:03,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:05:03,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:05:03,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:05:03,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:05:03,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:05:03,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:05:03,110 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 05:05:03,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:05:03,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:05:03,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:05:03,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:05:03,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:05:03,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:05:03,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:05:03,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:05:03,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:05:03,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:05:03,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:05:03,116 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:05:03,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:05:03,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:05:03,117 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:05:03,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:05:03,118 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2024-11-09 05:05:03,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:05:03,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:05:03,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:05:03,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:05:03,524 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:05:03,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c Unable to find full path for "g++" [2024-11-09 05:05:05,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:05:06,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:05:06,246 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-09 05:05:06,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/data/57b413bdb/87fae0ab115b41cdadb581fbfa88ed49/FLAG546955fb8 [2024-11-09 05:05:06,273 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/data/57b413bdb/87fae0ab115b41cdadb581fbfa88ed49 [2024-11-09 05:05:06,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:05:06,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:05:06,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:05:06,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:05:06,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:05:06,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ad7511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06, skipping insertion in model container [2024-11-09 05:05:06,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:05:06,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:05:06,557 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:05:06,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:05:06,605 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:05:06,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06 WrapperNode [2024-11-09 05:05:06,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:05:06,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:05:06,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:05:06,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:05:06,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,650 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-09 05:05:06,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:05:06,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:05:06,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:05:06,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:05:06,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:05:06,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:05:06,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:05:06,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:05:06,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (1/1) ... [2024-11-09 05:05:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:05:06,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:06,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:05:06,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:05:06,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:05:06,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:05:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:05:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:05:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-09 05:05:06,784 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-09 05:05:06,784 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-09 05:05:06,784 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-09 05:05:06,784 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-09 05:05:06,785 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-09 05:05:06,785 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-11-09 05:05:06,785 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-11-09 05:05:06,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:05:06,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:05:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:05:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:05:06,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:05:06,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:05:07,382 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 05:05:07,382 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:05:07,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:05:07,504 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:05:07,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:07 BoogieIcfgContainer [2024-11-09 05:05:07,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:05:07,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:05:07,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:05:07,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:05:07,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:05:06" (1/3) ... [2024-11-09 05:05:07,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47760518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:05:07, skipping insertion in model container [2024-11-09 05:05:07,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:05:06" (2/3) ... [2024-11-09 05:05:07,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47760518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:05:07, skipping insertion in model container [2024-11-09 05:05:07,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:05:07" (3/3) ... [2024-11-09 05:05:07,519 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2024-11-09 05:05:07,541 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:05:07,542 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 05:05:07,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:05:07,624 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;@458bf415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:05:07,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 05:05:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.48) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 05:05:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:05:07,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:07,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:07,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1456900990, now seen corresponding path program 1 times [2024-11-09 05:05:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521132869] [2024-11-09 05:05:07,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:08,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521132869] [2024-11-09 05:05:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521132869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:08,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:05:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725215167] [2024-11-09 05:05:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:08,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:08,577 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.48) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-09 05:05:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:08,879 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2024-11-09 05:05:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:05:08,883 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-09 05:05:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:08,893 INFO L225 Difference]: With dead ends: 98 [2024-11-09 05:05:08,893 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 05:05:08,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:08,901 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:08,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:05:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 05:05:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-09 05:05:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 35 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:05:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-09 05:05:08,947 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 11 [2024-11-09 05:05:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:08,948 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-09 05:05:08,948 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-09 05:05:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-09 05:05:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:05:08,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:08,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:05:08,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1916990516, now seen corresponding path program 1 times [2024-11-09 05:05:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537484766] [2024-11-09 05:05:08,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:09,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537484766] [2024-11-09 05:05:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537484766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:09,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:05:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419538004] [2024-11-09 05:05:09,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:09,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:09,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:09,337 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-09 05:05:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:09,494 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2024-11-09 05:05:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:05:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2024-11-09 05:05:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:09,496 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:05:09,496 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 05:05:09,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:05:09,499 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:09,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 05:05:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-09 05:05:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:05:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-09 05:05:09,533 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2024-11-09 05:05:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-09 05:05:09,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-09 05:05:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-09 05:05:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:05:09,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:09,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:05:09,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 702836230, now seen corresponding path program 1 times [2024-11-09 05:05:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125924100] [2024-11-09 05:05:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:09,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125924100] [2024-11-09 05:05:09,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125924100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:09,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:09,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:05:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830422071] [2024-11-09 05:05:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:05:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:05:09,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:05:09,733 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 05:05:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:09,800 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-09 05:05:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:05:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2024-11-09 05:05:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:09,802 INFO L225 Difference]: With dead ends: 47 [2024-11-09 05:05:09,802 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 05:05:09,803 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-09 05:05:09,808 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:09,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 05:05:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 05:05:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 36 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:05:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-09 05:05:09,826 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 15 [2024-11-09 05:05:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-09 05:05:09,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-09 05:05:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-09 05:05:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:05:09,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:09,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:09,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:05:09,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:09,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1911039939, now seen corresponding path program 1 times [2024-11-09 05:05:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:09,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870094351] [2024-11-09 05:05:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:09,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:05:10,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870094351] [2024-11-09 05:05:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870094351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:10,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:05:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864196475] [2024-11-09 05:05:10,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:05:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:05:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:05:10,092 INFO L87 Difference]: Start difference. First operand 46 states and 52 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-09 05:05:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:10,306 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2024-11-09 05:05:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:05:10,307 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-09 05:05:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:10,308 INFO L225 Difference]: With dead ends: 94 [2024-11-09 05:05:10,308 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 05:05:10,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:10,313 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:10,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 100 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:05:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 05:05:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 05:05:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 38 states have internal predecessors, (39), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 05:05:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-09 05:05:10,336 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 14 [2024-11-09 05:05:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:10,336 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-09 05:05:10,337 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-09 05:05:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-09 05:05:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 05:05:10,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:10,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:10,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:05:10,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:10,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1500420822, now seen corresponding path program 1 times [2024-11-09 05:05:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:10,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371662863] [2024-11-09 05:05:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:10,712 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-09 05:05:10,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371662863] [2024-11-09 05:05:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371662863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:05:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:05:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:05:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034661346] [2024-11-09 05:05:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:05:10,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:05:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:05:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:05:10,717 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:05:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:10,905 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-11-09 05:05:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:05:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 05:05:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:10,908 INFO L225 Difference]: With dead ends: 54 [2024-11-09 05:05:10,908 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 05:05:10,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:05:10,910 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:10,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 135 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:05:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 05:05:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2024-11-09 05:05:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 36 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 05:05:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-09 05:05:10,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 19 [2024-11-09 05:05:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:10,934 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-09 05:05:10,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:05:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-09 05:05:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:05:10,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:10,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:10,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:05:10,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:10,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash -214899351, now seen corresponding path program 1 times [2024-11-09 05:05:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059846246] [2024-11-09 05:05:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:11,612 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-09 05:05:11,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059846246] [2024-11-09 05:05:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059846246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:11,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398800973] [2024-11-09 05:05:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:11,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:11,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:11,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:05:11,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:05:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:11,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:05:11,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:11,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:05:12,233 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-09 05:05:12,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:05:12,909 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-09 05:05:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398800973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:05:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182835129] [2024-11-09 05:05:12,934 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:05:12,935 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:05:12,941 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:05:12,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:05:12,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2024-11-09 05:05:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310555763] [2024-11-09 05:05:12,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:05:12,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:05:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:12,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:05:12,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-11-09 05:05:12,947 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 24 states, 19 states have (on average 1.736842105263158) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 05:05:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:13,618 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2024-11-09 05:05:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:05:13,619 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.736842105263158) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2024-11-09 05:05:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:13,620 INFO L225 Difference]: With dead ends: 98 [2024-11-09 05:05:13,620 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 05:05:13,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2024-11-09 05:05:13,622 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:13,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 245 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:05:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 05:05:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 05:05:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 38 states have internal predecessors, (39), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-09 05:05:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-09 05:05:13,635 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 24 [2024-11-09 05:05:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:13,636 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-09 05:05:13,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.736842105263158) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 05:05:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-09 05:05:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 05:05:13,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:13,638 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:13,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:05:13,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:13,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:13,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1899158159, now seen corresponding path program 2 times [2024-11-09 05:05:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:13,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987244920] [2024-11-09 05:05:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 05:05:14,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987244920] [2024-11-09 05:05:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987244920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389609519] [2024-11-09 05:05:14,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:05:14,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:14,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:14,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:05:14,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:05:15,072 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 05:05:15,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:05:15,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:05:15,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:15,091 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 454 treesize of output 442 [2024-11-09 05:05:15,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:05:15,393 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-09 05:05:15,647 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-09 05:05:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:05:15,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:05:15,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base v_ArrVal_178) c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset)))) is different from false [2024-11-09 05:05:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389609519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [699148557] [2024-11-09 05:05:15,959 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:05:15,959 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:05:15,960 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:05:15,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:05:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-11-09 05:05:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164808732] [2024-11-09 05:05:15,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:05:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 05:05:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:15,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 05:05:15,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=777, Unknown=1, NotChecked=56, Total=930 [2024-11-09 05:05:15,964 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 24 states have internal predecessors, (41), 10 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:05:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:16,994 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2024-11-09 05:05:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 05:05:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 24 states have internal predecessors, (41), 10 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 38 [2024-11-09 05:05:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:16,997 INFO L225 Difference]: With dead ends: 113 [2024-11-09 05:05:16,997 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 05:05:16,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=1858, Unknown=1, NotChecked=88, Total=2162 [2024-11-09 05:05:17,000 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:17,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 290 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:05:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 05:05:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2024-11-09 05:05:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 42 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 05:05:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-09 05:05:17,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 38 [2024-11-09 05:05:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:17,016 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-09 05:05:17,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 24 states have internal predecessors, (41), 10 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:05:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-09 05:05:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 05:05:17,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:17,018 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:17,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:05:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 05:05:17,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1063554471, now seen corresponding path program 1 times [2024-11-09 05:05:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846523507] [2024-11-09 05:05:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:05:18,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:18,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846523507] [2024-11-09 05:05:18,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846523507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:18,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783355765] [2024-11-09 05:05:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:18,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:18,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:18,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:05:18,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:05:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:18,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 05:05:18,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:18,764 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 130 treesize of output 126 [2024-11-09 05:05:18,962 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-09 05:05:19,282 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-09 05:05:19,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:05:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-09 05:05:19,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:05:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783355765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:19,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1015650981] [2024-11-09 05:05:19,686 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 05:05:19,686 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:05:19,686 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:05:19,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:05:19,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2024-11-09 05:05:19,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910994357] [2024-11-09 05:05:19,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:05:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 05:05:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 05:05:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=883, Unknown=7, NotChecked=0, Total=992 [2024-11-09 05:05:19,691 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 29 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 25 states have internal predecessors, (44), 10 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 05:05:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:20,775 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-11-09 05:05:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 05:05:20,776 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 25 states have internal predecessors, (44), 10 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 46 [2024-11-09 05:05:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:20,778 INFO L225 Difference]: With dead ends: 122 [2024-11-09 05:05:20,778 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 05:05:20,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=239, Invalid=2105, Unknown=8, NotChecked=0, Total=2352 [2024-11-09 05:05:20,781 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 71 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:20,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 320 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:05:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 05:05:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-09 05:05:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 45 states have internal predecessors, (46), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-09 05:05:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-11-09 05:05:20,796 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 46 [2024-11-09 05:05:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:20,796 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-11-09 05:05:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 25 states have internal predecessors, (44), 10 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 05:05:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-11-09 05:05:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:05:20,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:20,798 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:05:20,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:05:21,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 05:05:21,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 534679781, now seen corresponding path program 1 times [2024-11-09 05:05:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347041590] [2024-11-09 05:05:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 05:05:22,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:05:22,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347041590] [2024-11-09 05:05:22,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347041590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:05:22,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136499160] [2024-11-09 05:05:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:22,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:22,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:05:22,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:05:22,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:05:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:05:22,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 05:05:22,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:05:22,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:05:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 05:05:23,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:05:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:05:28,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136499160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:05:28,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [68374825] [2024-11-09 05:05:28,524 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 05:05:28,525 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:05:28,525 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:05:28,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:05:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 31] total 50 [2024-11-09 05:05:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130337779] [2024-11-09 05:05:28,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:05:28,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 05:05:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:05:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 05:05:28,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 05:05:28,534 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 50 states, 40 states have (on average 1.7) internal successors, (68), 43 states have internal predecessors, (68), 12 states have call successors, (15), 9 states have call predecessors, (15), 15 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-09 05:05:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:05:29,497 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2024-11-09 05:05:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:05:29,498 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 40 states have (on average 1.7) internal successors, (68), 43 states have internal predecessors, (68), 12 states have call successors, (15), 9 states have call predecessors, (15), 15 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) Word has length 62 [2024-11-09 05:05:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:05:29,500 INFO L225 Difference]: With dead ends: 128 [2024-11-09 05:05:29,500 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 05:05:29,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=653, Invalid=2653, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 05:05:29,502 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:05:29,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 421 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:05:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 05:05:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-11-09 05:05:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.236842105263158) internal successors, (47), 46 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 05:05:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-09 05:05:29,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 62 [2024-11-09 05:05:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:05:29,518 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-09 05:05:29,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 40 states have (on average 1.7) internal successors, (68), 43 states have internal predecessors, (68), 12 states have call successors, (15), 9 states have call predecessors, (15), 15 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-09 05:05:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-09 05:05:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 05:05:29,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:05:29,521 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, 1, 1, 1] [2024-11-09 05:05:29,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:05:29,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:05:29,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:05:29,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:05:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1912369558, now seen corresponding path program 2 times [2024-11-09 05:05:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:05:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099154985] [2024-11-09 05:05:29,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:05:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:05:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:27,095 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-09 05:07:27,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:07:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099154985] [2024-11-09 05:07:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099154985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682285981] [2024-11-09 05:07:27,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:07:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:07:27,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:07:27,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:07:27,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-09 05:07:27,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:07:27,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-09 05:07:27,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:27,397 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 414 treesize of output 406 [2024-11-09 05:07:27,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:07:30,223 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_58| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) is different from false [2024-11-09 05:07:30,225 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_58| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) is different from true [2024-11-09 05:07:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 05:07:30,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:07:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682285981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1062864082] [2024-11-09 05:07:31,135 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 05:07:31,135 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:07:31,137 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:07:31,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:07:31,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2024-11-09 05:07:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395619978] [2024-11-09 05:07:31,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:07:31,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 05:07:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:07:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 05:07:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1131, Unknown=15, NotChecked=68, Total=1332 [2024-11-09 05:07:31,141 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 36 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 05:07:31,733 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_58| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from false [2024-11-09 05:07:31,735 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_24_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_58| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_24_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_58| (store |c_old(#memory_int)| |c_func_to_recursive_line_24_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_58| |c_func_to_recursive_line_24_to_25_0_#in~d.base|))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from true [2024-11-09 05:07:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:32,837 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2024-11-09 05:07:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 05:07:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2024-11-09 05:07:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:32,847 INFO L225 Difference]: With dead ends: 139 [2024-11-09 05:07:32,847 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 05:07:32,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=280, Invalid=2674, Unknown=24, NotChecked=214, Total=3192 [2024-11-09 05:07:32,850 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 78 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:32,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 396 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 707 Invalid, 3 Unknown, 91 Unchecked, 0.7s Time] [2024-11-09 05:07:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 05:07:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-09 05:07:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 48 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 12 states have return successors, (16), 13 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 05:07:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-09 05:07:32,886 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 69 [2024-11-09 05:07:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:32,886 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-09 05:07:32,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 05:07:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-09 05:07:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 05:07:32,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:32,892 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:32,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:07:33,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 05:07:33,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:07:33,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1520646849, now seen corresponding path program 1 times [2024-11-09 05:07:33,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:07:33,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437910111] [2024-11-09 05:07:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:07:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 05:07:39,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:07:39,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437910111] [2024-11-09 05:07:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437910111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:39,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126954268] [2024-11-09 05:07:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:07:39,753 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:07:39,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:07:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:39,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-09 05:07:39,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:39,981 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 838 treesize of output 822 [2024-11-09 05:07:40,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:07:40,024 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-09 05:07:42,242 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_73| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_73| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_73| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_73|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:07:44,243 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_73| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_73| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_73| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_73|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:07:46,285 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_74| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_74| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_74| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_74|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:07:48,287 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_74| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_74| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_74| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_74|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:07:50,323 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_75| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_75| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_75| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_75|) (= (store |v_#memory_int_BEFORE_CALL_75| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:07:52,325 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_75| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_75| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_75| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_75|) (= (store |v_#memory_int_BEFORE_CALL_75| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:07:52,414 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 23 treesize of output 3 [2024-11-09 05:07:52,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:07:54,742 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_87| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_87| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_87| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_87|) (= (store |v_#memory_int_BEFORE_CALL_87| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:07:56,744 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_87| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_87| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_87| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_87|) (= (store |v_#memory_int_BEFORE_CALL_87| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:07:58,809 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_89| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_89| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_89| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_89| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_89|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0))))) is different from false [2024-11-09 05:08:00,811 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_89| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_89| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_89| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_89| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_89|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0))))) is different from true [2024-11-09 05:08:02,843 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_46| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_46| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_46| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_46| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:08:04,849 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_46| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_46| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_46| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_46| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:08:06,906 WARN L851 $PredicateComparison]: unable to prove that (or (< 0 (+ 2147483649 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483648)) (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)))))) is different from false [2024-11-09 05:08:06,909 WARN L873 $PredicateComparison]: unable to prove that (or (< 0 (+ 2147483649 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483648)) (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)))))) is different from true [2024-11-09 05:08:06,918 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-09 05:08:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 20 proven. 64 refuted. 0 times theorem prover too weak. 419 trivial. 64 not checked. [2024-11-09 05:08:06,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:08:07,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126954268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1987853953] [2024-11-09 05:08:07,281 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 05:08:07,282 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:08:07,282 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:08:07,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:08:07,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 28 [2024-11-09 05:08:07,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362943436] [2024-11-09 05:08:07,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:08:07,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 05:08:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:08:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 05:08:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=568, Unknown=19, NotChecked=378, Total=1056 [2024-11-09 05:08:07,287 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 30 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 16 states have internal predecessors, (36), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 05:08:09,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_#memory_int_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_73| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_73| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_73| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_73|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_74| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_74| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_74| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_74|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse2)))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_89| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_89| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_89| .cse3 (select |c_#memory_int| .cse3))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_89| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_89|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3))))) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_75| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_75| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse4) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_75| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_75|) (= (store |v_#memory_int_BEFORE_CALL_75| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_87| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_87| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse5) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_87| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_87|) (= (store |v_#memory_int_BEFORE_CALL_87| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_46| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_46| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_46| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_46| .cse6 (select |c_#memory_int| .cse6))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse6)))) .cse1))) is different from false [2024-11-09 05:08:11,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_#memory_int_BEFORE_CALL_73| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_73| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_73| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_73| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_73|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_74| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_74| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_74| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_74| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_74|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse2)))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_89| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_89| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_89| .cse3 (select |c_#memory_int| .cse3))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_89| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_89|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3))))) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_75| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_75| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse4) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_75| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_75|) (= (store |v_#memory_int_BEFORE_CALL_75| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_87| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_87| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse5) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_87| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_#memory_int_BEFORE_CALL_87|) (= (store |v_#memory_int_BEFORE_CALL_87| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_46| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_46| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_46| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_46| .cse6 (select |c_#memory_int| .cse6))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse6)))) .cse1))) is different from true [2024-11-09 05:08:11,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (or (< 0 (+ 2147483649 .cse0)) (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483648)) (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse1)))))) (= .cse0 0))) is different from false [2024-11-09 05:08:11,728 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (or (< 0 (+ 2147483649 .cse0)) (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483648)) (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse1)))))) (= .cse0 0))) is different from true [2024-11-09 05:08:13,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (or (< 0 (+ 2147483649 .cse0)) (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483648)) (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse1)))))) (<= 1 .cse0))) is different from false [2024-11-09 05:08:13,884 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (or (< 0 (+ 2147483649 .cse0)) (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483648)) (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse1)))))) (<= 1 .cse0))) is different from true [2024-11-09 05:08:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:08:14,107 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-11-09 05:08:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 05:08:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 16 states have internal predecessors, (36), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) Word has length 112 [2024-11-09 05:08:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:08:14,109 INFO L225 Difference]: With dead ends: 81 [2024-11-09 05:08:14,109 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 05:08:14,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 138 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=200, Invalid=1375, Unknown=25, NotChecked=850, Total=2450 [2024-11-09 05:08:14,110 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:08:14,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 363 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 537 Invalid, 0 Unknown, 578 Unchecked, 0.5s Time] [2024-11-09 05:08:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 05:08:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 05:08:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 54 states have internal predecessors, (57), 12 states have call successors, (12), 8 states have call predecessors, (12), 13 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 05:08:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-11-09 05:08:14,125 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 112 [2024-11-09 05:08:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:08:14,126 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-11-09 05:08:14,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 16 states have internal predecessors, (36), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 05:08:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-11-09 05:08:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 05:08:14,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:08:14,128 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:08:14,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:08:14,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 05:08:14,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:08:14,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:08:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash -104587898, now seen corresponding path program 1 times [2024-11-09 05:08:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:08:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523311820] [2024-11-09 05:08:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:08:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:08:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:08:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 05:08:19,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:08:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523311820] [2024-11-09 05:08:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523311820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995753806] [2024-11-09 05:08:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:08:19,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:08:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:08:19,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:08:19,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:08:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:08:19,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-09 05:08:19,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:08:19,805 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 96 treesize of output 94 [2024-11-09 05:08:19,926 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-09 05:08:22,150 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_56| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_56| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_56| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_56| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:08:24,152 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_56| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_56| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_56| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_56| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:08:26,254 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_59| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_59| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_59| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_59| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_59| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 05:08:28,255 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_59| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_59| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_59| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_59| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_59| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 05:08:30,294 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_104| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_104| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_104| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_104| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_104| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 05:08:32,296 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_104| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_104| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_104| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_104| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_104| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 05:08:34,354 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 6)) is different from false [2024-11-09 05:08:34,357 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 6)) is different from true [2024-11-09 05:08:34,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:08:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 306 proven. 22 refuted. 0 times theorem prover too weak. 224 trivial. 16 not checked. [2024-11-09 05:08:34,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:08:34,655 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_683 (Array Int Int))) (< (select (select (store |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base v_ArrVal_683) c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 2147483647)) is different from false [2024-11-09 05:08:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995753806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:34,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1517859794] [2024-11-09 05:08:34,659 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 05:08:34,660 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:08:34,660 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:08:34,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:08:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 27 [2024-11-09 05:08:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031802076] [2024-11-09 05:08:34,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:08:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 05:08:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:08:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 05:08:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=573, Unknown=9, NotChecked=260, Total=930 [2024-11-09 05:08:34,663 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 28 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 18 states have internal predecessors, (44), 11 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-09 05:08:36,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_56| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_56| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_56| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_56| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_59| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_59| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_59| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_59| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse2 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_59| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))))) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_104| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_104| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_104| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_104| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3) (= (store |v_#memory_int_BEFORE_CALL_104| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|))))))) is different from false [2024-11-09 05:08:38,974 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_56| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_56| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_56| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_56| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_59| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_59| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_59| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_59| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse2 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_old(#memory_int)_AFTER_CALL_59| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|))))) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_104| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_104| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_104| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_104| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3) (= (store |v_#memory_int_BEFORE_CALL_104| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|))))))) is different from true [2024-11-09 05:08:38,996 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (not (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< .cse1 6)) (= .cse1 0))) is different from false [2024-11-09 05:08:38,999 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (not (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< .cse1 6)) (= .cse1 0))) is different from true [2024-11-09 05:08:41,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (not (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< .cse1 6)) (<= .cse1 1))) is different from false [2024-11-09 05:08:41,111 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (not (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< .cse1 6)) (<= .cse1 1))) is different from true [2024-11-09 05:08:43,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (not (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< .cse1 6)) (<= .cse1 5))) is different from false [2024-11-09 05:08:43,366 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base c_func_to_recursive_line_24_to_25_0_~d.base)) (not (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| |c_func_to_recursive_line_24_to_25_0_#in~c.base|)) (or (exists ((|v_old(#memory_int)_AFTER_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_61| |c_#memory_int|))) (and (not (= c_func_to_recursive_line_24_to_25_0_~c.base .cse0)) (= (store |v_old(#memory_int)_AFTER_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_61| c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset) 5)))) (< .cse1 6)) (<= .cse1 5))) is different from true [2024-11-09 05:08:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:08:43,406 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-11-09 05:08:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 05:08:43,407 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 18 states have internal predecessors, (44), 11 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 113 [2024-11-09 05:08:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:08:43,408 INFO L225 Difference]: With dead ends: 78 [2024-11-09 05:08:43,408 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 05:08:43,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=257, Invalid=1742, Unknown=17, NotChecked=846, Total=2862 [2024-11-09 05:08:43,414 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 57 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:08:43,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 253 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 332 Invalid, 0 Unknown, 361 Unchecked, 0.3s Time] [2024-11-09 05:08:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 05:08:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 05:08:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 53 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 13 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 05:08:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-09 05:08:43,432 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 113 [2024-11-09 05:08:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:08:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-09 05:08:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 18 states have internal predecessors, (44), 11 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-09 05:08:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-09 05:08:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 05:08:43,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:08:43,435 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:08:43,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:08:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:08:43,640 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:08:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:08:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1681475195, now seen corresponding path program 3 times [2024-11-09 05:08:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:08:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788363236] [2024-11-09 05:08:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:08:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:08:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:08:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-09 05:08:49,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:08:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788363236] [2024-11-09 05:08:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788363236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:08:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569146935] [2024-11-09 05:08:49,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:08:49,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:08:49,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:08:49,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:08:49,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:08:49,895 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:08:49,895 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:08:49,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 169 conjuncts are in the unsatisfiable core [2024-11-09 05:08:49,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:08:49,917 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 84 treesize of output 76 [2024-11-09 05:08:50,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:08:52,434 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_115| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_115| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_115| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_115| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_115| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:08:54,436 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_115| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_115| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_115| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_115| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_115| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:08:56,469 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_116| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_116| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_116| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_116| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= (store |v_#memory_int_BEFORE_CALL_116| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:08:58,470 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_116| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_116| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_116| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_116| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= (store |v_#memory_int_BEFORE_CALL_116| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:09:00,521 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_117| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_117| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_117| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_117| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_117| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:09:02,523 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_117| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_117| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_117| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_117| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_117| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:09:04,597 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_119| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_119| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_119| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_119| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:09:06,599 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_119| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_119| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_119| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_119| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:09:08,648 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_68| |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_old(#memory_int)_AFTER_CALL_68| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_68| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_old(#memory_int)_AFTER_CALL_68| c_func_to_recursive_line_24_to_25_0_~d.base))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from false [2024-11-09 05:09:10,650 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_68| |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_old(#memory_int)_AFTER_CALL_68| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_68| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_old(#memory_int)_AFTER_CALL_68| c_func_to_recursive_line_24_to_25_0_~d.base))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from true [2024-11-09 05:09:13,111 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_134| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_134| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_134| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= |v_#memory_int_BEFORE_CALL_134| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_134| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:09:15,113 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_134| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_134| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_134| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= |v_#memory_int_BEFORE_CALL_134| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_134| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:09:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 19 proven. 74 refuted. 0 times theorem prover too weak. 430 trivial. 56 not checked. [2024-11-09 05:09:15,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:09:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569146935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1970226788] [2024-11-09 05:09:16,547 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 05:09:16,547 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:09:16,548 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:09:16,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:09:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 44 [2024-11-09 05:09:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553330653] [2024-11-09 05:09:16,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:09:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 05:09:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:09:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 05:09:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1407, Unknown=15, NotChecked=486, Total=2070 [2024-11-09 05:09:16,551 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 45 states, 35 states have (on average 1.457142857142857) internal successors, (51), 32 states have internal predecessors, (51), 14 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (18), 15 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 05:09:18,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_#memory_int_BEFORE_CALL_115| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_115| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_115| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_115| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_115| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (or (exists ((|v_#memory_int_BEFORE_CALL_117| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_117| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_117| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_117| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_117| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_134| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_134| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_134| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3) (= |v_#memory_int_BEFORE_CALL_134| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_134| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_119| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_119| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_119| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= .cse4 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_119| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_116| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_116| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_116| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_116| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= (store |v_#memory_int_BEFORE_CALL_116| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse5)))) .cse1))) is different from false [2024-11-09 05:09:18,982 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_#memory_int_BEFORE_CALL_115| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_115| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_115| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_115| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_115| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (or (exists ((|v_#memory_int_BEFORE_CALL_117| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_117| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_117| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_117| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_117| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_134| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_134| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_134| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3) (= |v_#memory_int_BEFORE_CALL_134| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_134| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_119| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_119| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_119| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= .cse4 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_119| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_116| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_116| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_116| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_116| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= (store |v_#memory_int_BEFORE_CALL_116| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse5)))) .cse1))) is different from true [2024-11-09 05:09:21,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) .cse0 (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_68| |c_#memory_int|))) (and (= .cse1 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_old(#memory_int)_AFTER_CALL_68| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_68| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_old(#memory_int)_AFTER_CALL_68| c_func_to_recursive_line_24_to_25_0_~d.base))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base))) is different from false [2024-11-09 05:09:21,011 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) .cse0 (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_68| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_68| |c_#memory_int|))) (and (= .cse1 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_old(#memory_int)_AFTER_CALL_68| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_68| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_old(#memory_int)_AFTER_CALL_68| c_func_to_recursive_line_24_to_25_0_~d.base))))))) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base))) is different from true [2024-11-09 05:09:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:09:22,520 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2024-11-09 05:09:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 05:09:22,521 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 35 states have (on average 1.457142857142857) internal successors, (51), 32 states have internal predecessors, (51), 14 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (18), 15 states have call predecessors, (18), 10 states have call successors, (18) Word has length 124 [2024-11-09 05:09:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:09:22,522 INFO L225 Difference]: With dead ends: 162 [2024-11-09 05:09:22,522 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:09:22,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 145 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=302, Invalid=2568, Unknown=24, NotChecked=888, Total=3782 [2024-11-09 05:09:22,525 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 33 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:09:22,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 364 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 600 Invalid, 7 Unknown, 402 Unchecked, 1.2s Time] [2024-11-09 05:09:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:09:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-09 05:09:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 14 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-09 05:09:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-11-09 05:09:22,545 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 124 [2024-11-09 05:09:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:09:22,545 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-11-09 05:09:22,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 35 states have (on average 1.457142857142857) internal successors, (51), 32 states have internal predecessors, (51), 14 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (18), 15 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 05:09:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-11-09 05:09:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 05:09:22,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:09:22,549 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 18, 18, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:09:22,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 05:09:22,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:09:22,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:09:22,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:09:22,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1583198598, now seen corresponding path program 2 times [2024-11-09 05:09:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:09:22,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629279236] [2024-11-09 05:09:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:09:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 58 proven. 121 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-11-09 05:09:31,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:09:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629279236] [2024-11-09 05:09:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629279236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272316210] [2024-11-09 05:09:31,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:09:31,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:09:31,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:09:31,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:09:31,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:09:31,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 05:09:31,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:09:31,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-11-09 05:09:31,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:09:31,698 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 838 treesize of output 822 [2024-11-09 05:09:32,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:09:32,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:09:34,714 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_150| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_150| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_150| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))))))) is different from false [2024-11-09 05:09:36,716 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_150| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_150| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_150| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))))))) is different from true [2024-11-09 05:09:36,956 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-09 05:09:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 616 proven. 41 refuted. 0 times theorem prover too weak. 653 trivial. 6 not checked. [2024-11-09 05:09:37,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:09:37,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base v_ArrVal_1008) c_func_to_recursive_line_24_to_25_0_~c.base) c_func_to_recursive_line_24_to_25_0_~c.offset)))) is different from false [2024-11-09 05:09:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272316210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744426244] [2024-11-09 05:09:37,451 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 05:09:37,451 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:09:37,451 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:09:37,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:09:37,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2024-11-09 05:09:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598236927] [2024-11-09 05:09:37,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:09:37,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 05:09:37,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:09:37,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 05:09:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1295, Unknown=3, NotChecked=146, Total=1560 [2024-11-09 05:09:37,456 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 25 states have internal predecessors, (55), 15 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 05:09:40,078 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.offset| c_func_to_recursive_line_25_to_25_0_~d.offset) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_150| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_150| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_150| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))))) is different from false [2024-11-09 05:09:40,082 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.offset| c_func_to_recursive_line_25_to_25_0_~d.offset) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_150| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_150| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_150| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))))) is different from true [2024-11-09 05:09:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:09:41,801 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2024-11-09 05:09:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-09 05:09:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 25 states have internal predecessors, (55), 15 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11) Word has length 165 [2024-11-09 05:09:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:09:41,803 INFO L225 Difference]: With dead ends: 134 [2024-11-09 05:09:41,803 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 05:09:41,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 221 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=514, Invalid=5499, Unknown=5, NotChecked=462, Total=6480 [2024-11-09 05:09:41,805 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 178 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:09:41,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 432 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 862 Invalid, 0 Unknown, 156 Unchecked, 0.9s Time] [2024-11-09 05:09:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 05:09:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 78. [2024-11-09 05:09:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 53 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 14 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-09 05:09:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-09 05:09:41,826 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 165 [2024-11-09 05:09:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:09:41,827 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-09 05:09:41,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 25 states have internal predecessors, (55), 15 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 05:09:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-09 05:09:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 05:09:41,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:09:41,831 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:09:41,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 05:09:42,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:09:42,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-11-09 05:09:42,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:09:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -3162419, now seen corresponding path program 4 times [2024-11-09 05:09:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:09:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175008259] [2024-11-09 05:09:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:09:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2410 backedges. 119 proven. 212 refuted. 0 times theorem prover too weak. 2079 trivial. 0 not checked. [2024-11-09 05:09:55,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:09:55,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175008259] [2024-11-09 05:09:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175008259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:55,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951184752] [2024-11-09 05:09:55,863 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 05:09:55,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:09:55,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:09:55,865 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:09:55,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a6e7918-5fc1-49bf-8433-31fe6b2db41a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:09:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:56,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 282 conjuncts are in the unsatisfiable core [2024-11-09 05:09:56,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:09:56,234 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 250 treesize of output 242 [2024-11-09 05:09:56,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:09:58,558 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_101| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_101| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_101| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_101| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_101|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:10:00,560 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_101| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_101| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_101| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_101| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_101|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:10:02,691 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_168| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_168| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_168| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_168| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_168| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:10:04,693 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_168| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_168| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_168| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_168| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_168| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:10:06,754 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_169| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_169| |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_#memory_int_BEFORE_CALL_169| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_169| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_169| c_func_to_recursive_line_24_to_25_0_~d.base))))))) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from false [2024-11-09 05:10:08,755 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_169| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_169| |c_#memory_int|))) (and (= .cse0 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_#memory_int_BEFORE_CALL_169| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_169| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_169| c_func_to_recursive_line_24_to_25_0_~d.base))))))) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from true [2024-11-09 05:10:11,271 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_182| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_182| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_182| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_182| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_182| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:10:13,273 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_182| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_182| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_182| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_182| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_182| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:10:15,364 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (or (exists ((|v_#memory_int_BEFORE_CALL_184| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_184| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_184| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_184| c_func_to_recursive_line_24_to_25_0_~d.base))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_184| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 c_func_to_recursive_line_24_to_25_0_~d.base)))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|)) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from false [2024-11-09 05:10:17,366 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (or (exists ((|v_#memory_int_BEFORE_CALL_184| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_184| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_184| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_184| c_func_to_recursive_line_24_to_25_0_~d.base))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_184| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 c_func_to_recursive_line_24_to_25_0_~d.base)))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|)) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base)) is different from true [2024-11-09 05:10:19,727 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_194| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_194| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_194| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_194| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_194| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 05:10:21,729 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_194| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_194| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_194| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_194| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_194| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 05:10:23,763 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_195| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_195| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_195| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_195| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_195| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 05:10:25,765 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_195| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_195| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_195| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_195| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_195| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 05:10:27,892 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_119| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_119| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_119| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_119|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:10:29,894 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_119| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_119| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_119| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_119|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:10:32,267 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_209| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_209| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_209| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_209| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_209| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from false [2024-11-09 05:10:34,268 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_209| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_209| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_209| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_209| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_209| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|)) is different from true [2024-11-09 05:10:36,305 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_123| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_123| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_123| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_123|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_123| .cse0 (select |c_#memory_int| .cse0))))))) is different from false [2024-11-09 05:10:38,307 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_123| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_123| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_123| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_123|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_123| .cse0 (select |c_#memory_int| .cse0))))))) is different from true [2024-11-09 05:10:40,343 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_211| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_211| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= |v_#memory_int_BEFORE_CALL_211| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_211| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_211| .cse0 (select |c_#memory_int| .cse0))))))) is different from false [2024-11-09 05:10:42,344 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_211| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_211| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse0) (= |v_#memory_int_BEFORE_CALL_211| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_211| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_211| .cse0 (select |c_#memory_int| .cse0))))))) is different from true [2024-11-09 05:10:44,441 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_213| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_213| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_213| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_213| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_213| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))))))) is different from false [2024-11-09 05:10:46,443 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_213| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_213| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_213| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_213| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_213| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))))))) is different from true [2024-11-09 05:10:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2410 backedges. 127 proven. 235 refuted. 0 times theorem prover too weak. 1818 trivial. 230 not checked. [2024-11-09 05:10:48,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:10:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951184752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:10:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [462439859] [2024-11-09 05:10:50,938 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2024-11-09 05:10:50,938 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:10:50,938 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:10:50,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:10:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 36] total 50 [2024-11-09 05:10:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431822037] [2024-11-09 05:10:50,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:10:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-09 05:10:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:10:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-09 05:10:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1367, Unknown=43, NotChecked=1044, Total=2652 [2024-11-09 05:10:50,944 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 51 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 34 states have internal predecessors, (60), 12 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (29), 26 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-09 05:10:53,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_#memory_int_BEFORE_CALL_168| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_168| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_168| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_168| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_168| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_209| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_209| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_209| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_209| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_209| .cse2 (select |c_#memory_int| .cse2)))))) .cse1) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_211| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_211| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3) (= |v_#memory_int_BEFORE_CALL_211| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_211| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_211| .cse3 (select |c_#memory_int| .cse3))))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_213| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_213| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_213| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= .cse4 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_213| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_213| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_119| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int)_AFTER_CALL_119| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_119| .cse5 (select |c_#memory_int| .cse5))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_119|) (= .cse5 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) .cse1) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_123| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_123| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse6) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_123| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_123|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_123| .cse6 (select |c_#memory_int| .cse6))))))) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_182| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_182| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse7) (= (store |v_#memory_int_BEFORE_CALL_182| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_182| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_182| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_194| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int_BEFORE_CALL_194| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_194| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_194| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse8 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_194| .cse8 (select |c_#memory_int| .cse8)) |c_#memory_int|))))) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_195| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_#memory_int_BEFORE_CALL_195| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_195| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_195| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse9) (= (store |v_#memory_int_BEFORE_CALL_195| .cse9 (select |c_#memory_int| .cse9)) |c_#memory_int|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_101| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_int)_AFTER_CALL_101| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_101| .cse10 (select |c_#memory_int| .cse10)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_101| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_101|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse10)))) .cse1))) is different from false [2024-11-09 05:10:55,433 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |c_#memory_int| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |c_#memory_int|))) (and (or (exists ((|v_#memory_int_BEFORE_CALL_168| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_168| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_168| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_168| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_168| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_209| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_209| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_209| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_209| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_209| .cse2 (select |c_#memory_int| .cse2)))))) .cse1) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_211| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_211| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse3) (= |v_#memory_int_BEFORE_CALL_211| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_211| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_211| .cse3 (select |c_#memory_int| .cse3))))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_25_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_25_to_25_0_~d.base)) |c_#memory_int|) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_213| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_213| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_213| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= .cse4 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= |v_#memory_int_BEFORE_CALL_213| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_213| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_119| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int)_AFTER_CALL_119| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_119| .cse5 (select |c_#memory_int| .cse5))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_119| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_119|) (= .cse5 |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))) .cse1) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_123| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_123| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse6) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_123| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_123|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_123| .cse6 (select |c_#memory_int| .cse6))))))) (= c_func_to_recursive_line_25_to_25_0_~d.base |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (or (exists ((|v_#memory_int_BEFORE_CALL_182| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_182| |c_#memory_int|))) (and (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse7) (= (store |v_#memory_int_BEFORE_CALL_182| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_182| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_182| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)))))) .cse1) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_194| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int_BEFORE_CALL_194| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_194| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_194| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= .cse8 |c_func_to_recursive_line_25_to_25_0_#in~d.base|) (= (store |v_#memory_int_BEFORE_CALL_194| .cse8 (select |c_#memory_int| .cse8)) |c_#memory_int|))))) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_195| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_#memory_int_BEFORE_CALL_195| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_195| (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_#memory_int_BEFORE_CALL_195| |c_func_to_recursive_line_25_to_25_0_#in~d.base|))) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse9) (= (store |v_#memory_int_BEFORE_CALL_195| .cse9 (select |c_#memory_int| .cse9)) |c_#memory_int|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_101| (Array Int (Array Int Int)))) (let ((.cse10 (@diff |v_old(#memory_int)_AFTER_CALL_101| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_101| .cse10 (select |c_#memory_int| .cse10)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_25_to_25_0_#in~d.base| (select |v_old(#memory_int)_AFTER_CALL_101| |c_func_to_recursive_line_25_to_25_0_#in~d.base|)) |v_old(#memory_int)_AFTER_CALL_101|) (= |c_func_to_recursive_line_25_to_25_0_#in~d.base| .cse10)))) .cse1))) is different from true [2024-11-09 05:10:57,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_169| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_169| |c_#memory_int|))) (and (= .cse1 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_#memory_int_BEFORE_CALL_169| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_169| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_169| c_func_to_recursive_line_24_to_25_0_~d.base))))))) .cse0 (or (exists ((|v_#memory_int_BEFORE_CALL_184| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_184| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_184| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_184| c_func_to_recursive_line_24_to_25_0_~d.base))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_184| .cse2 (select |c_#memory_int| .cse2))) (= .cse2 c_func_to_recursive_line_24_to_25_0_~d.base)))) .cse0) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base))) is different from false [2024-11-09 05:10:57,490 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |c_#memory_int| c_func_to_recursive_line_24_to_25_0_~d.base)) |c_#memory_int|))) (and (= |c_func_to_recursive_line_24_to_25_0_#in~c.offset| c_func_to_recursive_line_24_to_25_0_~c.offset) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_169| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_169| |c_#memory_int|))) (and (= .cse1 c_func_to_recursive_line_24_to_25_0_~d.base) (= (store |v_#memory_int_BEFORE_CALL_169| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_169| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_169| c_func_to_recursive_line_24_to_25_0_~d.base))))))) .cse0 (or (exists ((|v_#memory_int_BEFORE_CALL_184| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_184| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_184| (store |c_old(#memory_int)| c_func_to_recursive_line_24_to_25_0_~d.base (select |v_#memory_int_BEFORE_CALL_184| c_func_to_recursive_line_24_to_25_0_~d.base))) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_184| .cse2 (select |c_#memory_int| .cse2))) (= .cse2 c_func_to_recursive_line_24_to_25_0_~d.base)))) .cse0) (= c_func_to_recursive_line_24_to_25_0_~c.base |c_func_to_recursive_line_24_to_25_0_#in~c.base|) (= |c_func_to_recursive_line_24_to_25_0_#in~d.base| c_func_to_recursive_line_24_to_25_0_~d.base))) is different from true [2024-11-09 05:10:59,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:11:01,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]