./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e26acfe1cf31c22927dddbe8bb86ce97c7f4fab4905c983e00ec89f406b53a47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:49:35,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:49:35,921 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-11-08 23:49:35,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:49:35,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:49:35,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:49:35,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:49:35,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:49:35,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:49:35,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:49:35,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:49:35,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:49:35,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:49:35,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:49:35,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:49:35,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:49:35,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:49:35,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:49:35,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:49:35,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:49:35,956 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-08 23:49:35,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 23:49:35,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:49:35,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:49:35,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:49:35,959 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:49:35,959 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:49:35,959 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:49:35,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:49:35,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:49:35,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:49:35,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:49:35,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:49:35,968 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:49:35,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:49:35,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/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_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> e26acfe1cf31c22927dddbe8bb86ce97c7f4fab4905c983e00ec89f406b53a47 [2024-11-08 23:49:36,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:49:36,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:49:36,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:49:36,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:49:36,262 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:49:36,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps4.c Unable to find full path for "g++" [2024-11-08 23:49:38,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:49:38,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:49:38,517 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/sv-benchmarks/c/recursified_nla-digbench/recursified_ps4.c [2024-11-08 23:49:38,524 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/data/2ac06244e/5e0785efbd79414aaf486a22b15f2d96/FLAGadb45be7e [2024-11-08 23:49:38,830 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/data/2ac06244e/5e0785efbd79414aaf486a22b15f2d96 [2024-11-08 23:49:38,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:49:38,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:49:38,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:49:38,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:49:38,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:49:38,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:49:38" (1/1) ... [2024-11-08 23:49:38,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47584209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:38, skipping insertion in model container [2024-11-08 23:49:38,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:49:38" (1/1) ... [2024-11-08 23:49:38,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:49:39,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:49:39,108 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:49:39,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:49:39,148 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:49:39,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39 WrapperNode [2024-11-08 23:49:39,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:49:39,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:49:39,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:49:39,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:49:39,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,189 INFO L138 Inliner]: procedures = 16, calls = 70, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2024-11-08 23:49:39,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:49:39,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:49:39,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:49:39,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:49:39,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:49:39,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:49:39,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:49:39,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:49:39,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:39" (1/1) ... [2024-11-08 23:49:39,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:49:39,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:49:39,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:49:39,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb60b1b8-39a7-4c5d-8d3e-6b282ae95575/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:49:39,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:49:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2024-11-08 23:49:39,281 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2024-11-08 23:49:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:49:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 23:49:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 23:49:39,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:49:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 23:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 23:49:39,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 23:49:39,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 23:49:39,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:49:39,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:49:40,326 INFO L? ?]: Removed 209 outVars from TransFormulas that were not future-live. [2024-11-08 23:49:40,326 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:49:40,384 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:49:40,385 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:49:40,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:40 BoogieIcfgContainer [2024-11-08 23:49:40,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:49:40,387 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:49:40,387 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:49:40,398 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:49:40,398 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:40" (1/1) ... [2024-11-08 23:49:40,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 138 states and 142 transitions. [2024-11-08 23:49:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2024-11-08 23:49:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 23:49:40,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:41,096 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-08 23:49:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 141 states and 145 transitions. [2024-11-08 23:49:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2024-11-08 23:49:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:49:41,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:41,522 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-08 23:49:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 142 states and 146 transitions. [2024-11-08 23:49:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2024-11-08 23:49:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:49:41,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:41,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:49:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:41,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 23:49:41,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:49:41,835 INFO L349 Elim1Store]: treesize reduction 55, result has 35.3 percent of original size [2024-11-08 23:49:41,837 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 2 case distinctions, treesize of input 64 treesize of output 45 [2024-11-08 23:49:41,858 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 34 treesize of output 32 [2024-11-08 23:49:41,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:41,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:41,904 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-08 23:49:41,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 50 [2024-11-08 23:49:42,142 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-08 23:49:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 147 states and 155 transitions. [2024-11-08 23:49:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2024-11-08 23:49:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:49:42,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:42,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:49:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:42,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 23:49:42,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:49:42,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:42,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:43,063 INFO L349 Elim1Store]: treesize reduction 135, result has 34.8 percent of original size [2024-11-08 23:49:43,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 199 [2024-11-08 23:49:43,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:43,119 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 357 treesize of output 355 [2024-11-08 23:49:43,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:43,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 23:49:43,251 INFO L349 Elim1Store]: treesize reduction 114, result has 13.0 percent of original size [2024-11-08 23:49:43,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 71 [2024-11-08 23:49:43,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-11-08 23:49:43,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-08 23:49:43,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-08 23:49:43,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-08 23:49:43,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-08 23:49:43,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 23:49:43,664 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:43,666 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2024-11-08 23:49:43,769 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 23:49:43,770 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 41 [2024-11-08 23:49:43,813 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 23:49:43,814 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 15 treesize of output 11 [2024-11-08 23:49:43,853 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:43,855 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2024-11-08 23:49:43,864 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-08 23:49:43,951 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-08 23:49:43,951 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2024-11-08 23:49:43,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:43,989 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 15 treesize of output 19 [2024-11-08 23:49:44,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-11-08 23:49:44,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:49:44,722 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-08 23:49:44,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 76 [2024-11-08 23:49:44,736 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-08 23:49:44,736 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2024-11-08 23:49:44,777 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:44,778 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 105 [2024-11-08 23:49:44,816 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:44,817 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2024-11-08 23:49:44,911 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:49:44,913 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2024-11-08 23:50:55,696 WARN L286 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 90 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:51:47,783 WARN L286 SmtUtils]: Spent 51.64s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:52:58,593 WARN L286 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 90 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:52:59,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 23:52:59,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 4667 treesize of output 4455 [2024-11-08 23:53:02,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 23:53:02,211 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-08 23:53:02,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 1 [2024-11-08 23:53:02,215 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 11 treesize of output 7 [2024-11-08 23:53:02,225 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-08 23:54:52,829 WARN L286 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 96 DAG size of output: 93 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:55:53,320 WARN L286 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:56:03,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|))) (let ((.cse14 (= |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (.cse2 (= (select .cse0 0) 0))) (and (not (and (or (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| .cse1) |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|))))) .cse2) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_14) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse3 (select .cse4 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= (select .cse3 0) 0) (= v_DerPreprocessor_14 .cse3) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse4 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse0) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) .cse2) (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (and (= .cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) |c_ULTIMATE.start_main_~#y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))) .cse2) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#k~0#1.offset| Int)) (let ((.cse8 (store (store .cse9 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse0 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse6 (select .cse7 |ULTIMATE.start_main_~#x~0#1.base|)) (.cse5 (select .cse7 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= .cse5 (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)) (= .cse6 (store .cse5 0 0)) (= (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse8) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_11 .cse6) (= .cse5 v_DerPreprocessor_9))))) (= .cse0 .cse8)))) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))) (= (select .cse9 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|))))) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.offset| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#x~0#1.base| .cse13))) (let ((.cse11 (store (store .cse13 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse0 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0)) (.cse10 (select .cse12 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse10) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse11 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse0 .cse11) (= v_DerPreprocessor_5 .cse10))))) (= (select .cse13 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) .cse14)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) .cse14 (not (= |c_ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) .cse2 (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false [2024-11-08 23:56:03,352 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|))) (and (or (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| .cse1) |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|))))) (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (and (= .cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) |c_ULTIMATE.start_main_~#y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_14) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse2 (select .cse3 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= (select .cse2 0) 0) (= v_DerPreprocessor_14 .cse2) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse3 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse0) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#k~0#1.offset| Int)) (let ((.cse7 (store (store .cse8 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse0 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse5 (select .cse6 |ULTIMATE.start_main_~#x~0#1.base|)) (.cse4 (select .cse6 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= .cse4 (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)) (= .cse5 (store .cse4 0 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse7) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_11 .cse5) (= .cse4 v_DerPreprocessor_9))))) (= .cse0 .cse7)))) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))) (= (select .cse8 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|))))) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.offset| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#x~0#1.base| .cse12))) (let ((.cse10 (store (store .cse12 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse0 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0)) (.cse9 (select .cse11 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse9) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse10 (select .cse11 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse0 .cse10) (= v_DerPreprocessor_5 .cse9))))) (= (select .cse12 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#y~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0)))) is different from false [2024-11-08 23:56:13,379 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base|))) (let ((.cse14 (= |c_ULTIMATE.start_main_~#y~0#1.offset| 0)) (.cse2 (= (select .cse0 0) 0))) (and (not (and (or (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| .cse1) |c_ULTIMATE.start_main_~#y~0#1.base|)) (= (select .cse1 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|))))) .cse2) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_14) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse3 (select .cse4 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= (select .cse3 0) 0) (= v_DerPreprocessor_14 .cse3) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)) (= (select .cse4 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse0) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) .cse2) (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (and (= .cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) |c_ULTIMATE.start_main_~#y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))) .cse2) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~#k~0#1.offset| Int)) (let ((.cse8 (store (store .cse9 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse0 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse7 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse6 (select .cse7 |ULTIMATE.start_main_~#x~0#1.base|)) (.cse5 (select .cse7 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= .cse5 (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)) (= .cse6 (store .cse5 0 0)) (= (select .cse7 |c_ULTIMATE.start_main_~#y~0#1.base|) .cse8) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_11 .cse6) (= .cse5 v_DerPreprocessor_9))))) (= .cse0 .cse8)))) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#c~0#1.base|)))) (= (select .cse9 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|))))) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.offset| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#y~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#x~0#1.base| .cse13))) (let ((.cse11 (store (store .cse13 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse0 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0)) (.cse10 (select .cse12 |ULTIMATE.start_main_~#k~0#1.base|))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse10) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse11 (select .cse12 |c_ULTIMATE.start_main_~#y~0#1.base|)) (= .cse0 .cse11) (= v_DerPreprocessor_5 .cse10))))) (= (select .cse13 0) 0) (not (= |c_ULTIMATE.start_main_~#y~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) .cse14)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 0) .cse14 (not (= |c_ULTIMATE.start_main_~#c~0#1.base| |c_ULTIMATE.start_main_~#x~0#1.base|)) .cse2 (= |c_ULTIMATE.start_main_~#x~0#1.offset| 0))))) is different from true [2024-11-08 23:59:29,473 WARN L286 SmtUtils]: Spent 3.27m on a formula simplification. DAG size of input: 96 DAG size of output: 96 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:00:30,127 WARN L286 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:00:30,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base|))) (let ((.cse12 (= (select .cse1 0) 0)) (.cse14 (= |c_func_to_recursive_line_25_to_33_0_#in~y.offset| 0))) (and (not (and (or (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse0 0) 0) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#c~0#1.base|)) (exists ((|ULTIMATE.start_main_~#k~0#1.offset| Int)) (let ((.cse2 (store (store .cse0 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse1 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (= .cse1 .cse2) (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9) |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_10) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse3 (select .cse5 |ULTIMATE.start_main_~#k~0#1.base|)) (.cse4 (select .cse5 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse3 (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_11 .cse4) (= .cse3 v_DerPreprocessor_9) (= (select .cse5 |c_func_to_recursive_line_25_to_33_0_#in~y.base|) .cse2) (= (store .cse3 0 0) .cse4))))))))))))) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.offset| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_5) |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#x~0#1.base| .cse9))) (let ((.cse6 (select .cse8 |ULTIMATE.start_main_~#k~0#1.base|)) (.cse7 (store (store .cse9 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse1 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse6) (= .cse1 .cse7) (= v_DerPreprocessor_5 .cse6) (= .cse7 (select .cse8 |c_func_to_recursive_line_25_to_33_0_#in~y.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse9 0) 0)))) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_14) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse10 (select .cse11 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= (select .cse10 0) 0) (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse1 (select .cse11 |c_func_to_recursive_line_25_to_33_0_#in~y.base|)) (= .cse10 v_DerPreprocessor_14) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) 0) 0))))) .cse12) (and .cse12 (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse1 (select (store (store |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) |c_func_to_recursive_line_25_to_33_0_#in~y.base|))))) (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse1 (select (store (store |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| .cse13) |c_func_to_recursive_line_25_to_33_0_#in~y.base|)) (= (select .cse13 0) 0)))) .cse12)) .cse14)) (= |c_func_to_recursive_line_25_to_33_0_#in~x.offset| 0) (= (select (select |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~x.base|) 0) 0) .cse12 .cse14))) is different from false [2024-11-09 00:02:10,794 WARN L286 SmtUtils]: Spent 1.67m on a formula simplification that was a NOOP. DAG size: 97 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:02:10,832 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base|))) (let ((.cse12 (= (select .cse1 0) 0)) (.cse14 (= |c_func_to_recursive_line_25_to_33_0_#in~y.offset| 0))) (and (not (and (or (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse0 0) 0) (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int)) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#c~0#1.base|)) (exists ((|ULTIMATE.start_main_~#k~0#1.offset| Int)) (let ((.cse2 (store (store .cse0 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse1 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (= .cse1 .cse2) (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_9) |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_10) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse3 (select .cse5 |ULTIMATE.start_main_~#k~0#1.base|)) (.cse4 (select .cse5 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= .cse3 (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= v_DerPreprocessor_11 .cse4) (= .cse3 v_DerPreprocessor_9) (= (select .cse5 |c_func_to_recursive_line_25_to_33_0_#in~y.base|) .cse2) (= (store .cse3 0 0) .cse4))))))))))))) (exists ((|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_main_~#k~0#1.offset| Int) (|ULTIMATE.start_main_~#k~0#1.base| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base| v_DerPreprocessor_5) |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_6) |ULTIMATE.start_main_~#x~0#1.base| .cse9))) (let ((.cse6 (select .cse8 |ULTIMATE.start_main_~#k~0#1.base|)) (.cse7 (store (store .cse9 |ULTIMATE.start_main_~#k~0#1.offset| (select .cse1 |ULTIMATE.start_main_~#k~0#1.offset|)) 0 0))) (and (= (select |c_#memory_int| |ULTIMATE.start_main_~#k~0#1.base|) .cse6) (= .cse1 .cse7) (= v_DerPreprocessor_5 .cse6) (= .cse7 (select .cse8 |c_func_to_recursive_line_25_to_33_0_#in~y.base|)) (not (= |ULTIMATE.start_main_~#k~0#1.base| |ULTIMATE.start_main_~#x~0#1.base|)))))) (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= (select .cse9 0) 0)))) (and (exists ((|ULTIMATE.start_main_~#c~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| v_DerPreprocessor_14) |ULTIMATE.start_main_~#c~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#c~0#1.base|)))) (let ((.cse10 (select .cse11 |ULTIMATE.start_main_~#x~0#1.base|))) (and (= (select .cse10 0) 0) (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#c~0#1.base|)) (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse1 (select .cse11 |c_func_to_recursive_line_25_to_33_0_#in~y.base|)) (= .cse10 v_DerPreprocessor_14) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) 0) 0))))) .cse12) (and .cse12 (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse1 (select (store (store |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) |c_func_to_recursive_line_25_to_33_0_#in~y.base|))))) (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (|ULTIMATE.start_main_~#x~0#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (and (not (= |c_func_to_recursive_line_25_to_33_0_#in~y.base| |ULTIMATE.start_main_~#x~0#1.base|)) (= .cse1 (select (store (store |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~y.base| v_DerPreprocessor_13) |ULTIMATE.start_main_~#x~0#1.base| .cse13) |c_func_to_recursive_line_25_to_33_0_#in~y.base|)) (= (select .cse13 0) 0)))) .cse12)) .cse14)) (= |c_func_to_recursive_line_25_to_33_0_#in~x.offset| 0) (= (select (select |c_#memory_int| |c_func_to_recursive_line_25_to_33_0_#in~x.base|) 0) 0) .cse12 .cse14)))) is different from true [2024-11-09 00:04:11,597 WARN L286 SmtUtils]: Spent 2.01m on a formula simplification. DAG size of input: 95 DAG size of output: 95 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:05:12,500 WARN L286 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)