./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/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_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:38:10,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:38:10,769 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:38:10,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:38:10,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:38:10,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:38:10,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:38:10,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:38:10,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:38:10,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:38:10,830 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:38:10,831 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:38:10,832 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:38:10,833 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:38:10,835 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:38:10,836 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:38:10,836 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:38:10,836 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:38:10,837 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:38:10,837 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:38:10,838 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:38:10,839 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:38:10,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:38:10,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:38:10,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:38:10,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:38:10,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:38:10,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:38:10,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:38:10,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:38:10,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:38:10,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:38:10,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:38:10,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:38:10,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:38:10,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:38:10,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:38:10,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:38:10,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:38:10,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:38:10,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:38:10,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:38:10,848 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:38:10,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:38:10,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:38:10,849 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:38:10,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:38:10,850 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_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/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_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2024-11-09 04:38:11,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:38:11,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:38:11,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:38:11,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:38:11,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:38:11,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c Unable to find full path for "g++" [2024-11-09 04:38:13,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:38:13,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:38:13,803 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-09 04:38:13,813 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/data/f82c9536a/4b55dda2cb16495a8545b8e3162c42d1/FLAGfe250a5dc [2024-11-09 04:38:14,112 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/data/f82c9536a/4b55dda2cb16495a8545b8e3162c42d1 [2024-11-09 04:38:14,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:38:14,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:38:14,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:38:14,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:38:14,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:38:14,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c08063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14, skipping insertion in model container [2024-11-09 04:38:14,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:38:14,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2024-11-09 04:38:14,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:38:14,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:38:14,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c[1963,1976] [2024-11-09 04:38:14,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:38:14,429 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:38:14,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14 WrapperNode [2024-11-09 04:38:14,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:38:14,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:38:14,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:38:14,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:38:14,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,467 INFO L138 Inliner]: procedures = 14, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2024-11-09 04:38:14,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:38:14,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:38:14,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:38:14,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:38:14,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:38:14,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:38:14,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:38:14,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:38:14,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (1/1) ... [2024-11-09 04:38:14,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:38:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:14,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:38:14,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:38:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:38:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:38:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:38:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:38:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-09 04:38:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-09 04:38:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-09 04:38:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-09 04:38:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:38:14,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:38:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:38:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-09 04:38:14,575 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-09 04:38:14,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:38:14,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:38:14,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:38:14,910 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-09 04:38:14,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:38:14,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:38:14,968 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:38:14,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:38:14 BoogieIcfgContainer [2024-11-09 04:38:14,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:38:14,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:38:14,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:38:14,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:38:14,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:38:14" (1/3) ... [2024-11-09 04:38:14,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6577090f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:38:14, skipping insertion in model container [2024-11-09 04:38:14,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:38:14" (2/3) ... [2024-11-09 04:38:14,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6577090f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:38:14, skipping insertion in model container [2024-11-09 04:38:14,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:38:14" (3/3) ... [2024-11-09 04:38:14,984 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-09 04:38:15,007 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:38:15,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:38:15,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:38:15,088 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;@4e5e4e70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:38:15,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:38:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 04:38:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 04:38:15,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:15,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:38:15,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1151432377, now seen corresponding path program 1 times [2024-11-09 04:38:15,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:15,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815036946] [2024-11-09 04:38:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:15,861 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 04:38:15,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815036946] [2024-11-09 04:38:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815036946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:38:15,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:38:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:38:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889812332] [2024-11-09 04:38:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:38:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:38:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:15,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:38:15,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:38:15,911 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:38:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:16,130 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 04:38:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:38:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-11-09 04:38:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:16,144 INFO L225 Difference]: With dead ends: 39 [2024-11-09 04:38:16,144 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 04:38:16,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 04:38:16,151 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:16,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:38:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 04:38:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-09 04:38:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 04:38:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 04:38:16,204 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2024-11-09 04:38:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 04:38:16,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:38:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 04:38:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:38:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:16,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:38:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:38:16,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:16,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash -808235070, now seen corresponding path program 1 times [2024-11-09 04:38:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:16,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825949558] [2024-11-09 04:38:16,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:16,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 04:38:16,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825949558] [2024-11-09 04:38:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825949558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:38:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:38:16,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:38:16,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481822108] [2024-11-09 04:38:16,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:38:16,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:38:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:38:16,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:38:16,575 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:38:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:16,748 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-09 04:38:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:38:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2024-11-09 04:38:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:16,750 INFO L225 Difference]: With dead ends: 56 [2024-11-09 04:38:16,751 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 04:38:16,752 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 04:38:16,753 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:16,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:38:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 04:38:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 04:38:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 04:38:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 04:38:16,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2024-11-09 04:38:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:16,768 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 04:38:16,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 04:38:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 04:38:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 04:38:16,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:16,774 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:38:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:38:16,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1443235882, now seen corresponding path program 1 times [2024-11-09 04:38:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:16,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331706452] [2024-11-09 04:38:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:38:17,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:17,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331706452] [2024-11-09 04:38:17,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331706452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:38:17,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:38:17,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:38:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860045384] [2024-11-09 04:38:17,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:38:17,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:38:17,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:38:17,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:38:17,233 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 04:38:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:17,356 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2024-11-09 04:38:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:38:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-11-09 04:38:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:17,359 INFO L225 Difference]: With dead ends: 58 [2024-11-09 04:38:17,359 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 04:38:17,360 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 04:38:17,361 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:17,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:38:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 04:38:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 04:38:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 04:38:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-09 04:38:17,372 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 31 [2024-11-09 04:38:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:17,373 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-09 04:38:17,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 04:38:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-09 04:38:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:38:17,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:17,375 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:38:17,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:38:17,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1079350702, now seen corresponding path program 1 times [2024-11-09 04:38:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:17,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812118458] [2024-11-09 04:38:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:38:17,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812118458] [2024-11-09 04:38:17,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812118458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:17,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908152135] [2024-11-09 04:38:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:17,936 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:17,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:38:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:18,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:38:18,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:18,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:38:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:38:18,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:38:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908152135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:38:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475439872] [2024-11-09 04:38:19,532 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 04:38:19,533 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:38:19,538 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 04:38:19,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:38:19,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-11-09 04:38:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268213444] [2024-11-09 04:38:19,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:38:19,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 04:38:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:19,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 04:38:19,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-09 04:38:19,545 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 04:38:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:19,992 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2024-11-09 04:38:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:38:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 36 [2024-11-09 04:38:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:19,995 INFO L225 Difference]: With dead ends: 64 [2024-11-09 04:38:19,995 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 04:38:19,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2024-11-09 04:38:19,997 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:19,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:38:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 04:38:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 04:38:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-09 04:38:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 04:38:20,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 36 [2024-11-09 04:38:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:20,009 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 04:38:20,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 2.4375) internal successors, (39), 19 states have internal predecessors, (39), 8 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 04:38:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 04:38:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:38:20,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:20,012 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 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 04:38:20,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:38:20,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:20,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:20,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1508132862, now seen corresponding path program 2 times [2024-11-09 04:38:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:20,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834147563] [2024-11-09 04:38:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:38:21,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:21,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834147563] [2024-11-09 04:38:21,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834147563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:21,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187431421] [2024-11-09 04:38:21,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:38:21,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:21,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:21,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:38:21,426 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 04:38:21,427 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:38:21,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 04:38:21,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:21,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-09 04:38:21,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:38:22,137 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 30 treesize of output 22 [2024-11-09 04:38:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:38:22,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:22,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 04:38:22,723 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 04:38:22,732 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 29 treesize of output 21 [2024-11-09 04:38:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187431421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [857142673] [2024-11-09 04:38:23,256 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 04:38:23,256 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:38:23,257 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 04:38:23,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:38:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2024-11-09 04:38:23,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312753798] [2024-11-09 04:38:23,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:38:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 04:38:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 04:38:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=666, Unknown=1, NotChecked=0, Total=756 [2024-11-09 04:38:23,261 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 27 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 26 states have internal predecessors, (45), 12 states have call successors, (14), 2 states have call predecessors, (14), 11 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-09 04:38:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:24,357 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-11-09 04:38:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 04:38:24,358 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 26 states have internal predecessors, (45), 12 states have call successors, (14), 2 states have call predecessors, (14), 11 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) Word has length 46 [2024-11-09 04:38:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:24,359 INFO L225 Difference]: With dead ends: 81 [2024-11-09 04:38:24,360 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 04:38:24,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1594, Unknown=2, NotChecked=0, Total=1806 [2024-11-09 04:38:24,362 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:24,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 196 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:38:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 04:38:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 04:38:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-09 04:38:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-09 04:38:24,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 46 [2024-11-09 04:38:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-09 04:38:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 26 states have internal predecessors, (45), 12 states have call successors, (14), 2 states have call predecessors, (14), 11 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-09 04:38:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-09 04:38:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 04:38:24,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:24,378 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:38:24,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:38:24,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:24,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:24,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1384335612, now seen corresponding path program 3 times [2024-11-09 04:38:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553942113] [2024-11-09 04:38:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 12 proven. 143 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 04:38:25,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553942113] [2024-11-09 04:38:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553942113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758630809] [2024-11-09 04:38:25,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:38:25,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:25,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:25,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:38:26,179 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:38:26,180 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:38:26,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 04:38:26,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:26,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 04:38:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 123 proven. 24 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 04:38:26,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:38:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 6 proven. 165 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 04:38:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758630809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:38:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895775840] [2024-11-09 04:38:29,733 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 04:38:29,733 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:38:29,733 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 04:38:29,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:38:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 22] total 38 [2024-11-09 04:38:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123464169] [2024-11-09 04:38:29,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:38:29,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 04:38:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:38:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 04:38:29,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 04:38:29,739 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 38 states, 28 states have (on average 2.25) internal successors, (63), 32 states have internal predecessors, (63), 12 states have call successors, (21), 8 states have call predecessors, (21), 13 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-09 04:38:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:38:30,438 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2024-11-09 04:38:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 04:38:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 2.25) internal successors, (63), 32 states have internal predecessors, (63), 12 states have call successors, (21), 8 states have call predecessors, (21), 13 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) Word has length 82 [2024-11-09 04:38:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:38:30,441 INFO L225 Difference]: With dead ends: 80 [2024-11-09 04:38:30,441 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 04:38:30,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=412, Invalid=1750, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 04:38:30,444 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:38:30,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 219 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:38:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 04:38:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 04:38:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 04:38:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-09 04:38:30,456 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 82 [2024-11-09 04:38:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:38:30,457 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-09 04:38:30,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 2.25) internal successors, (63), 32 states have internal predecessors, (63), 12 states have call successors, (21), 8 states have call predecessors, (21), 13 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-09 04:38:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-09 04:38:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 04:38:30,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:38:30,459 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 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, 1, 1] [2024-11-09 04:38:30,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:38:30,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:30,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:38:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:38:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 816427588, now seen corresponding path program 4 times [2024-11-09 04:38:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:38:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549296869] [2024-11-09 04:38:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:38:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:38:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 04:38:41,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:38:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549296869] [2024-11-09 04:38:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549296869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:38:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149461983] [2024-11-09 04:38:41,071 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:38:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:38:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:38:41,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:38:41,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:38:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:38:41,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-09 04:38:41,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:38:41,318 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 04:38:41,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-09 04:38:41,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 04:38:43,808 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_33| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_33| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_33| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_33| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from false [2024-11-09 04:38:45,812 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_33| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_33| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_33| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_33| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from true [2024-11-09 04:38:47,856 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2024-11-09 04:38:49,858 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2024-11-09 04:38:51,947 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_old(#memory_int)_AFTER_CALL_36| c_func_to_recursive_line_22_to_23_0_~c.base))) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2024-11-09 04:38:51,950 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_old(#memory_int)_AFTER_CALL_36| c_func_to_recursive_line_22_to_23_0_~c.base))) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2024-11-09 04:38:54,220 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2024-11-09 04:38:56,222 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2024-11-09 04:38:58,255 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_60|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)))) is different from false [2024-11-09 04:39:00,256 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_60|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)))) is different from true [2024-11-09 04:39:02,328 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2024-11-09 04:39:04,329 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2024-11-09 04:39:06,367 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 04:39:08,369 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 04:39:10,412 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_43| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|))) is different from false [2024-11-09 04:39:10,415 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_43| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|))) is different from true [2024-11-09 04:39:12,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (or (exists ((|v_#memory_int_498| (Array Int (Array Int Int)))) (and (= |c_#memory_int| (store |v_#memory_int_498| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse0)) (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_43| |v_#memory_int_498|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse1 (select |v_#memory_int_498| .cse1)) |v_#memory_int_498|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|))) (= .cse1 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse0) |c_#memory_int|))) is different from false [2024-11-09 04:39:12,443 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (or (exists ((|v_#memory_int_498| (Array Int (Array Int Int)))) (and (= |c_#memory_int| (store |v_#memory_int_498| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse0)) (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_43| |v_#memory_int_498|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse1 (select |v_#memory_int_498| .cse1)) |v_#memory_int_498|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|))) (= .cse1 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse0) |c_#memory_int|))) is different from true [2024-11-09 04:39:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 21 proven. 68 refuted. 0 times theorem prover too weak. 295 trivial. 65 not checked. [2024-11-09 04:39:12,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:39:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149461983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:39:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065625922] [2024-11-09 04:39:13,707 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 04:39:13,707 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:39:13,708 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 04:39:13,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:39:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 42 [2024-11-09 04:39:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643867641] [2024-11-09 04:39:13,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:39:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 04:39:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:39:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 04:39:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=990, Unknown=32, NotChecked=648, Total=1806 [2024-11-09 04:39:13,713 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 42 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 14 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-09 04:39:16,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse2 (select |c_#memory_int| .cse2))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse3) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_33| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse4) (= (store |v_old(#memory_int)_AFTER_CALL_33| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_33| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_33| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|) (or (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_60|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse5)))) .cse0) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse6))))))) is different from false [2024-11-09 04:39:18,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_47|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse2 (select |c_#memory_int| .cse2))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_42| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_42| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_42| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_42| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse3) (= (store |v_old(#memory_int)_AFTER_CALL_42| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_33| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse4) (= (store |v_old(#memory_int)_AFTER_CALL_33| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_33| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_33| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|) (or (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_60|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse5)))) .cse0) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_62|) (= (store |v_#memory_int_BEFORE_CALL_62| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse6))))))) is different from true [2024-11-09 04:39:18,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_old(#memory_int)_AFTER_CALL_36| c_func_to_recursive_line_22_to_23_0_~c.base))) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0)))))) .cse1) .cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_43| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from false [2024-11-09 04:39:18,214 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_old(#memory_int)_AFTER_CALL_36| c_func_to_recursive_line_22_to_23_0_~c.base))) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0)))))) .cse1) .cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_43| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from true [2024-11-09 04:39:20,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base))) (let ((.cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) (.cse6 (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (.cse4 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|)) (.cse5 (select .cse0 c_func_to_recursive_line_22_to_23_0_~b.offset)) (.cse7 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= |c_#memory_int| (store (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) c_func_to_recursive_line_22_to_23_0_~b.base .cse0)) .cse1 (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (or (exists ((|v_#memory_int_498| (Array Int (Array Int Int)))) (and (= |c_#memory_int| (store |v_#memory_int_498| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse2)) (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_43| |v_#memory_int_498|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse3 (select |v_#memory_int_498| .cse3)) |v_#memory_int_498|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|))) (= .cse3 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse2) |c_#memory_int|))) (or (and .cse4 .cse1 (not (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base)) (<= .cse5 (+ .cse6 1))) .cse7) (or (and (not (= .cse6 0)) .cse4) (< .cse5 2) .cse7)))) is different from false [2024-11-09 04:39:20,222 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base))) (let ((.cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) (.cse6 (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (.cse4 (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|)) (.cse5 (select .cse0 c_func_to_recursive_line_22_to_23_0_~b.offset)) (.cse7 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|))) (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= |c_#memory_int| (store (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) c_func_to_recursive_line_22_to_23_0_~b.base .cse0)) .cse1 (let ((.cse2 (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (or (exists ((|v_#memory_int_498| (Array Int (Array Int Int)))) (and (= |c_#memory_int| (store |v_#memory_int_498| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse2)) (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_43| |v_#memory_int_498|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse3 (select |v_#memory_int_498| .cse3)) |v_#memory_int_498|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|))) (= .cse3 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse2) |c_#memory_int|))) (or (and .cse4 .cse1 (not (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base)) (<= .cse5 (+ .cse6 1))) .cse7) (or (and (not (= .cse6 0)) .cse4) (< .cse5 2) .cse7)))) is different from true [2024-11-09 04:39:21,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|))) (and (or (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (< 4 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_old(#memory_int)_AFTER_CALL_36| c_func_to_recursive_line_22_to_23_0_~c.base))) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0)))))) .cse1) .cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_43| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from false [2024-11-09 04:39:21,283 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|))) (and (or (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (< 4 (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_old(#memory_int)_AFTER_CALL_36| c_func_to_recursive_line_22_to_23_0_~c.base))) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0)))))) .cse1) .cse1 (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_43| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_43| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store |v_old(#memory_int)_AFTER_CALL_43| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_43| (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_43| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |c_#memory_int|)) (or (= c_func_to_recursive_line_22_to_23_0_~c.base c_func_to_recursive_line_22_to_23_0_~b.base) (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base)))))) is different from true [2024-11-09 04:39:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:39:21,460 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-11-09 04:39:21,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 04:39:21,462 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 14 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) Word has length 102 [2024-11-09 04:39:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:39:21,463 INFO L225 Difference]: With dead ends: 66 [2024-11-09 04:39:21,463 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 04:39:21,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 126 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=383, Invalid=2706, Unknown=43, NotChecked=1560, Total=4692 [2024-11-09 04:39:21,467 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 808 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:39:21,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 5 Unknown, 808 Unchecked, 0.7s Time] [2024-11-09 04:39:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 04:39:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 04:39:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 29 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-09 04:39:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-09 04:39:21,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 102 [2024-11-09 04:39:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:39:21,482 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-09 04:39:21,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 states have internal predecessors, (49), 14 states have call successors, (14), 2 states have call predecessors, (14), 10 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-09 04:39:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-09 04:39:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-09 04:39:21,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:39:21,486 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:39:21,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:39:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:21,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:39:21,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:39:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1036319201, now seen corresponding path program 5 times [2024-11-09 04:39:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:39:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809921450] [2024-11-09 04:39:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:39:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:39:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:39:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4246 backedges. 60 proven. 2311 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2024-11-09 04:39:36,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:39:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809921450] [2024-11-09 04:39:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809921450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:39:36,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134836543] [2024-11-09 04:39:36,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:39:36,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:39:36,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:39:36,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:39:36,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3521f3e-bfd7-40fd-8af9-e8e05e7001c6/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:39:42,973 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 04:39:42,973 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:39:42,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 330 conjuncts are in the unsatisfiable core [2024-11-09 04:39:43,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:39:43,036 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 42 treesize of output 38 [2024-11-09 04:39:43,242 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 04:39:45,574 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_77| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_77| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_77| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_77| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_77| .cse0 (select |c_#memory_int| .cse0))))))) is different from false [2024-11-09 04:39:47,576 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_77| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_77| |c_#memory_int|))) (and (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_77| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_77| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_77| .cse0 (select |c_#memory_int| .cse0))))))) is different from true [2024-11-09 04:39:49,679 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~c.offset| c_func_to_recursive_line_22_to_23_0_~c.offset) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_22_to_23_0_~c.base)) |v_#memory_int_BEFORE_CALL_86|) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base)))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2024-11-09 04:39:49,682 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~c.offset| c_func_to_recursive_line_22_to_23_0_~c.offset) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_22_to_23_0_~c.base)) |v_#memory_int_BEFORE_CALL_86|) (= .cse0 c_func_to_recursive_line_22_to_23_0_~c.base)))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2024-11-09 04:39:49,743 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~c.offset| c_func_to_recursive_line_22_to_23_0_~c.offset) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((v_DerPreprocessor_12 (Array Int Int))) (= |c_#memory_int| (let ((.cse0 (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_12))) (store .cse0 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select .cse0 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((|v_#memory_int_614| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_614| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse2 (select |v_#memory_int_614| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_614|))) (and (= |v_#memory_int_614| (store |v_#memory_int_BEFORE_CALL_86| .cse3 (select |v_#memory_int_614| .cse3))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_22_to_23_0_~c.base)) |v_#memory_int_BEFORE_CALL_86|) (= c_func_to_recursive_line_22_to_23_0_~c.base .cse3)))))))) is different from false [2024-11-09 04:39:49,750 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~c.base |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~c.offset| c_func_to_recursive_line_22_to_23_0_~c.offset) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base) (or (exists ((v_DerPreprocessor_12 (Array Int Int))) (= |c_#memory_int| (let ((.cse0 (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_12))) (store .cse0 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse1 (select .cse0 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1))))))) (exists ((|v_#memory_int_614| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_614| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse2 (select |v_#memory_int_614| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_614|))) (and (= |v_#memory_int_614| (store |v_#memory_int_BEFORE_CALL_86| .cse3 (select |v_#memory_int_614| .cse3))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~c.base (select |v_#memory_int_BEFORE_CALL_86| c_func_to_recursive_line_22_to_23_0_~c.base)) |v_#memory_int_BEFORE_CALL_86|) (= c_func_to_recursive_line_22_to_23_0_~c.base .cse3)))))))) is different from true [2024-11-09 04:39:52,736 WARN L851 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_111| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_111| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_111| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_111| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_111| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 04:39:54,738 WARN L873 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_111| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_111| |c_#memory_int|))) (and (= |v_#memory_int_BEFORE_CALL_111| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_111| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= (store |v_#memory_int_BEFORE_CALL_111| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 04:39:57,094 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (<= (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 5) (let ((.cse1 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0)))) (or (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse0 (@diff .cse1 |v_#memory_int_630|))) (and (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store .cse1 .cse0 (select |v_#memory_int_630| .cse0)) |v_#memory_int_630|) (= (store |v_#memory_int_630| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse2 (select |v_#memory_int_630| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|)))) (= (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2024-11-09 04:39:59,096 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (<= (select (select |c_old(#memory_int)| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset) 5) (let ((.cse1 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0)))) (or (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse0 (@diff .cse1 |v_#memory_int_630|))) (and (= .cse0 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store .cse1 .cse0 (select |v_#memory_int_630| .cse0)) |v_#memory_int_630|) (= (store |v_#memory_int_630| c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse2 (select |v_#memory_int_630| c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|)))) (= (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.base (let ((.cse3 (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.base))) (store .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset (+ (select .cse3 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)))) |c_#memory_int|))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2024-11-09 04:40:01,190 INFO L349 Elim1Store]: treesize reduction 50, result has 47.9 percent of original size [2024-11-09 04:40:01,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 170 [2024-11-09 04:40:03,288 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0)))) (or (= |c_#memory_int| (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse2 (@diff .cse0 |v_#memory_int_630|))) (and (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store .cse0 .cse2 (select |v_#memory_int_630| .cse2)) |v_#memory_int_630|) (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))))) (<= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 5) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2024-11-09 04:40:03,294 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0)))) (or (= |c_#memory_int| (store .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse2 (@diff .cse0 |v_#memory_int_630|))) (and (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|) (= (store .cse0 .cse2 (select |v_#memory_int_630| .cse2)) |v_#memory_int_630|) (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))))))) (<= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 5) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2024-11-09 04:40:03,438 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13))) (let ((.cse6 (select .cse5 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse0 (select .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (<= .cse0 4) (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse1 (let ((.cse4 (store .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse0 1)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse4) |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select (store .cse5 |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse4) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))))) (let ((.cse2 (@diff .cse1 |v_#memory_int_630|))) (and (= (store .cse1 .cse2 (select |v_#memory_int_630| .cse2)) |v_#memory_int_630|) (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))))))) (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse11 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13))) (let ((.cse12 (select .cse11 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse7 (select .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (<= .cse7 4) (= (let ((.cse10 (store .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse7 1)))) (let ((.cse8 (store (select (store .cse11 |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse10) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse8) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse9 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse10) |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse8) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse9 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse9 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))) |c_#memory_int|))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2024-11-09 04:40:03,447 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13))) (let ((.cse6 (select .cse5 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse0 (select .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (<= .cse0 4) (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse1 (let ((.cse4 (store .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse0 1)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse4) |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select (store .cse5 |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse4) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))))) (let ((.cse2 (@diff .cse1 |v_#memory_int_630|))) (and (= (store .cse1 .cse2 (select |v_#memory_int_630| .cse2)) |v_#memory_int_630|) (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse3 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (= .cse2 |c_func_to_recursive_line_22_to_23_0_#in~c.base|)))))))))) (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse11 (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13))) (let ((.cse12 (select .cse11 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse7 (select .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (<= .cse7 4) (= (let ((.cse10 (store .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse7 1)))) (let ((.cse8 (store (select (store .cse11 |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse10) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse8) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse9 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse10) |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse8) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse9 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse9 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))) |c_#memory_int|))))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2024-11-09 04:40:05,880 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int_614| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_614|))) (and (= |v_#memory_int_614| (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |v_#memory_int_614| .cse0))) (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse4 (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse6 (select |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse5 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= (let ((.cse3 (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse5 1)))) (let ((.cse1 (store (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse3) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))) (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse1) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse2 (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse3) |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse1) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse2 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse2 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))) |c_#memory_int|) (<= .cse5 4))))) (= |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_86|))) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int_614| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_614|))) (and (= |v_#memory_int_614| (store |v_#memory_int_BEFORE_CALL_86| .cse7 (select |v_#memory_int_614| .cse7))) (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse12 (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse14 (select |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse14 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse14 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse13 (select .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse13 1)))) (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse11) |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse11) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))))) (let ((.cse10 (@diff .cse9 |v_#memory_int_630|))) (and (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse8 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse8 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse8 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (= (store .cse9 .cse10 (select |v_#memory_int_630| .cse10)) |v_#memory_int_630|) (= |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse10))))) (<= .cse13 4))))) (= |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse7)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_86|))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse19 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse21 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_12) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse21 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse21 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse20 (select .cse19 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse16 (let ((.cse18 (store .cse19 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse20 1)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse18) |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse18) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))))) (let ((.cse17 (@diff .cse16 |v_#memory_int_630|))) (and (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse15 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse15 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse15 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (= (store .cse16 .cse17 (select |v_#memory_int_630| .cse17)) |v_#memory_int_630|) (= .cse17 |c_func_to_recursive_line_22_to_23_0_#in~c.base|))))) (<= .cse20 4))))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse27 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_12) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse27 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse27 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse26 (select .cse25 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= (let ((.cse24 (store .cse25 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse26 1)))) (let ((.cse22 (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse24) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse22) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse23 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse24) |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse22) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse23 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse23 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))) |c_#memory_int|) (<= .cse26 4)))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from false [2024-11-09 04:40:05,897 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int_614| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_614|))) (and (= |v_#memory_int_614| (store |v_#memory_int_BEFORE_CALL_86| .cse0 (select |v_#memory_int_614| .cse0))) (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse4 (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse6 (select |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse6 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse5 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= (let ((.cse3 (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse5 1)))) (let ((.cse1 (store (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse3) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))) (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse1) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse2 (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse3) |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse1) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse2 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse2 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))) |c_#memory_int|) (<= .cse5 4))))) (= |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_86|))) (exists ((|v_#memory_int_BEFORE_CALL_86| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int_614| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_86| |v_#memory_int_614|))) (and (= |v_#memory_int_614| (store |v_#memory_int_BEFORE_CALL_86| .cse7 (select |v_#memory_int_614| .cse7))) (exists ((v_DerPreprocessor_13 (Array Int Int))) (let ((.cse12 (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse14 (select |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse14 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse14 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse13 (select .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse13 1)))) (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse11) |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select (store (store |v_#memory_int_614| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse11) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))))) (let ((.cse10 (@diff .cse9 |v_#memory_int_630|))) (and (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse8 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse8 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse8 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (= (store .cse9 .cse10 (select |v_#memory_int_630| .cse10)) |v_#memory_int_630|) (= |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse10))))) (<= .cse13 4))))) (= |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse7)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_86| |c_func_to_recursive_line_22_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_86|))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse19 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse21 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_12) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse21 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse21 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse20 (select .cse19 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (exists ((|v_#memory_int_630| (Array Int (Array Int Int)))) (let ((.cse16 (let ((.cse18 (store .cse19 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse20 1)))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse18) |c_func_to_recursive_line_22_to_23_0_#in~c.base| (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse18) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))))) (let ((.cse17 (@diff .cse16 |v_#memory_int_630|))) (and (= |c_#memory_int| (store |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse15 (select |v_#memory_int_630| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse15 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse15 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (= (store .cse16 .cse17 (select |v_#memory_int_630| .cse17)) |v_#memory_int_630|) (= .cse17 |c_func_to_recursive_line_22_to_23_0_#in~c.base|))))) (<= .cse20 4))))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse25 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse27 (select (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_12) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse27 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse27 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))) |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (let ((.cse26 (select .cse25 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (= (let ((.cse24 (store .cse25 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ .cse26 1)))) (let ((.cse22 (store (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| v_DerPreprocessor_13) |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse24) |c_func_to_recursive_line_22_to_23_0_#in~c.base|) |c_func_to_recursive_line_22_to_23_0_#in~c.offset| 0))) (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse22) |c_func_to_recursive_line_22_to_23_0_#in~b.base| (let ((.cse23 (select (store (store |c_old(#memory_int)| |c_func_to_recursive_line_22_to_23_0_#in~b.base| .cse24) |c_func_to_recursive_line_22_to_23_0_#in~c.base| .cse22) |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (store .cse23 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| (+ (select .cse23 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)))))) |c_#memory_int|) (<= .cse26 4)))))) (<= 6 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) is different from true [2024-11-09 04:42:38,647 WARN L286 SmtUtils]: Spent 2.54m on a formula simplification. DAG size of input: 239 DAG size of output: 44 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:42:38,647 INFO L349 Elim1Store]: treesize reduction 812, result has 7.5 percent of original size [2024-11-09 04:42:38,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 21 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 26 new quantified variables, introduced 32 case distinctions, treesize of input 2131 treesize of output 5129 [2024-11-09 04:42:39,695 INFO L224 Elim1Store]: Index analysis took 113 ms [2024-11-09 04:43:23,086 WARN L286 SmtUtils]: Spent 43.38s on a formula simplification. DAG size of input: 29 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:43:23,086 INFO L349 Elim1Store]: treesize reduction 34, result has 45.2 percent of original size [2024-11-09 04:43:23,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 980 treesize of output 1080 [2024-11-09 04:43:25,784 INFO L224 Elim1Store]: Index analysis took 635 ms [2024-11-09 04:44:11,711 WARN L286 SmtUtils]: Spent 43.00s on a formula simplification. DAG size of input: 24 DAG size of output: 18 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:44:11,712 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-09 04:44:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 966 treesize of output 989 [2024-11-09 04:44:26,783 INFO L224 Elim1Store]: Index analysis took 1247 ms [2024-11-09 04:45:07,969 WARN L286 SmtUtils]: Spent 41.18s on a formula simplification. DAG size of input: 22 DAG size of output: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:45:07,970 INFO L349 Elim1Store]: treesize reduction 22, result has 46.3 percent of original size [2024-11-09 04:45:07,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 578 treesize of output 407 [2024-11-09 04:45:14,496 INFO L224 Elim1Store]: Index analysis took 1170 ms [2024-11-09 04:45:57,082 WARN L286 SmtUtils]: Spent 42.58s on a formula simplification. DAG size of input: 20 DAG size of output: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:45:57,082 INFO L349 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2024-11-09 04:45:57,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 2023 treesize of output 1664 [2024-11-09 04:46:01,473 INFO L224 Elim1Store]: Index analysis took 2173 ms [2024-11-09 04:46:07,232 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 0 (select (select v_arrayElimArr_12 |func_to_recursive_line_21_to_22_0_#in~c.base|) |func_to_recursive_line_21_to_22_0_#in~c.offset|)) [2024-11-09 04:46:31,413 WARN L286 SmtUtils]: Spent 24.18s on a formula simplification. DAG size of input: 17 DAG size of output: 12 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 04:46:31,413 INFO L349 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2024-11-09 04:46:31,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 43 [2024-11-09 04:47:31,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2024-11-09 04:47:32,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2024-11-09 04:47:33,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2024-11-09 04:47:39,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2024-11-09 04:47:40,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2024-11-09 04:47:41,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 5 [2024-11-09 04:49:14,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:14,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 1037 treesize of output 1134 [2024-11-09 04:49:16,014 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 7 treesize of output 5 [2024-11-09 04:49:17,642 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 7 treesize of output 5 [2024-11-09 04:49:18,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:18,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:18,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:18,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 657 treesize of output 642 [2024-11-09 04:49:19,647 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 7 treesize of output 5 [2024-11-09 04:49:33,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:49:33,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 04:49:33,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7